Submission #1245501

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int main() {
	cin.sync_with_stdio(false);
	int N, M;
	cin >> N >> M;
	vector<int>n(N+1);
	vector<int>s(M);
	vector<int>t(M);
	vector<int>only;
	vector<int>sum(N + 1);
	for (int i = 0;i < M;i++) {
		cin >> s[i] >> t[i];
			n[s[i]-1]++;
			n[t[i]]--;
	}
	for (int i = 0;i < N;i++) {
		n[i + 1] += n[i];
		if (n[i] == 1) {
			sum[i]++;
		}
		
	}
	for (int i = 0;i < N;i++) {
		sum[i + 1] += sum[i];
	}
	vector<int>sabo;
	bool flag;
	for (int i = 0;i < M;i++) {
		if (sum[t[i]-1] - sum[s[i]-1] == 0) {
			sabo.push_back(i+1);
		}
	}

	cout << sabo.size() << endl;
	for (int i = 0;i < sabo.size();i++) {
		cout << sabo[i] << endl;
	}
	return 0;

}

Submission Info

Judge Result