Submission #2526103

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <map>
#include <functional>
#include <array>

using namespace std;

int main(){
    int N, M;
    cin >> N >> M;

    vector<int> vec(N+1, 0);
    vector<int> s(M), t(M);
    for(int i = 0; i < M; ++i){
        cin >> s[i] >> t[i];
        --s[i], --t[i];
        vec[s[i]]++;
        vec[t[i]+1]--;
    }

    for(int i = 0; i < N-1; ++i){
        vec[i+1] += vec[i];
    }
    for(int i = 0; i < N; ++i){
        --vec[i];
    }
    vector<int> check(N+1, -1);
    int sento = -1;
    for(int i = 0; i < N; ++i){
        if(vec[i] > 0){
            if(sento == -1){
                sento = i;
            }
        } else if(sento != -1){
            for(int j = sento; j < i; ++j){
                check[j] = i - 1;
            }
            sento = -1;
        }
    }
    if(sento != -1){
        for(int j = sento; j < N; ++j){
            check[j] = N - 1;
        }
    }
/*
    for(int i = 0; i < N; ++i){
        cout << check[i] << " ";
    }
    cout << endl;*/
    int ans = 0;
    for(int i = 0; i < M; ++i){
        if(check[s[i]] != -1 && check[s[i]] >= t[i]){
            ++ans;
        }
    }
    cout << ans << endl;
    for(int i = 0; i < M; ++i){
        if(check[s[i]] != -1 && check[s[i]] >= t[i]){
            cout << i + 1 << endl;
        }
    }
}

Submission Info

Judge Result