Submission #1501750

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#define N 300003
typedef long long ll;
using namespace std;
 
int main(void){
    int a[N]={0};
    int s[100003];
    int t[100003];
    int ans[100003];
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>s[i]>>t[i];
        a[s[i]]++;
        a[t[i]+1]--;
    }
    int k=0;
    for(int i=0;i<=n;i++){
        a[i+1]+=a[i];
    }
    //for(int i=0;i<=n;i++)printf("%d\n",a[i]);
    for(int i=0;i<=n;i++){
        if(a[i]!=1)a[i]=0;
    }
    for(int i=0;i<=n;i++){
        a[i+1]+=a[i];
    }
    int j;
    for(int i=0;i<m;i++){
        if(a[t[i]]-a[s[i]-1]==0){
            ans[k]=i+1;
            k++;
        }
            }
    printf("%d\n",k);
    for(int i=0;i<k;i++){
        printf("%d\n",ans[i]);
    }
    return 0;
}

Submission Info

Judge Result