Submission #1245323

---

Source Code Expand

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

int main() {
	int N, M;
	cin >> N >> M;
	vector<int>n(N+1);
	vector<int>s(M);
	vector<int>t(M);
	vector<int>only;
	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++) {
		if (i) {
			n[i] += n[i - 1];
		}
		if (n[i] < 2) {
			only.push_back(i);
		}
	}
	vector<int>sabo;
	bool flag;
	if (only.size() <= 10000) {

		for (int i = 0;i < M;i++) {
			flag = true;
			for (int j = 0;j < only.size();j++) {
				if (s[i] - 1 <= only[j] && only[j] <= t[i] - 1) {
					flag = false;
					break;
				}
			}
			if (flag) {
				sabo.push_back(i + 1);
			}
		}
	}
	else {
		for (int i = 0;i < M;i++) {
			flag = true;
			for (int j = s[i] - 1;j < t[i];j++) {
				if (n[j] < 2) {
					flag = false;
					break;
				}
			}
			if (flag) {
				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