Submission #2525786

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
    ll N, M;
    cin >> N >> M;
    ll po[N + 1] = {};
    pair<ll, ll> yo[M];
    for(ll i = 0; i < M; i++){
        ll a, b;
        cin >> a >> b;
        po[--a]++;
        po[b--]--;
        yo[i] = pair<ll, ll>(a, b);
    }
    for(ll i = 0; i < N; i++) po[i + 1] += po[i];
    set<ll> se;
    vector<ll> v;
    for(ll i = 0; i < N; i++) if(po[i] == 1) se.insert(i);
    for(ll i = 0; i < M; i++){
        auto ite = se.lower_bound(yo[i].first);
        if(ite == se.end() || !(*ite <= yo[i].second)) v.push_back(i + 1);
    }
    cout << v.size() << endl;
    for(ll ana : v) cout << ana << endl;
    return 0;
}

Submission Info

Judge Result