Submission #1153292

---

Source Code Expand

#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const int INF = 2000000000;
using namespace std;

int main(){
    int n, m;
    cin >> n >> m;

    int imos[3 * 100005] = {0};
    pair<int, int> p[100005];
    rep(i,m){
        cin >> p[i].first >> p[i].second;
        imos[p[i].first]++;
        imos[p[i].second + 1]--;
    }

    range(i,1,n + 1){ imos[i] += imos[i - 1]; }
    rep(i,n + 1){ if(imos[i] > 1) imos[i] = 0; }
    range(i,1,n + 1){ imos[i] += imos[i - 1]; }

    //range(i,1,n + 1){ cout << imos[i] << endl;}
    vector<int> v;
    rep(i,m){
        if(imos[p[i].second] - imos[p[i].first - 1] == 0) v.emplace_back(i + 1);
    }
    cout << v.size() << endl;
    rep(i,v.size()){
        cout << v[i] << endl;
    }
}

Submission Info

Judge Result