Submission #2527088

---

Source Code Expand

// ARC 045 B ドキドキデート大作戦高橋君
#include <iostream>
#include <vector>

#define REP(i,n) for(int i=0; i<n; i++)

using namespace std;

int main(){
	int imos[300005], n, m, x[300005], a, b;
	vector<int> s;
	vector<int> t;
	vector<int> ans;
	
	cin >> n >> m;
	REP(i,n+2){
		imos[i] = 0;
	}
	ans.push_back(0);
	x[0] = 0;
	
	REP(i,m){
		cin >> a >> b;
		s.push_back(a);
		t.push_back(b);
		imos[a] += 1;
		imos[b+1] -= 1;
	}
	
	for (int i=1; i<=n; i++){
		imos[i] += imos[i-1];
	}
	
	//REP(i,n+2) cout << imos[i] << ",";
	//cout << endl;
	
	for (int i=1; i<=n; i++){
		if (imos[i]<=1) x[i] = 1;
		else x[i] = 0;
	}
	
	for (int i=1; i<=n; i++){
		x[i] += x[i-1];
	}
	
	REP(i,m){
		//cout << i << endl;
		if (x[t[i]]-x[s[i]-1]<=0){
			ans[0]++;
			ans.push_back(i+1);
		}
	}
	REP(i,ans.size()) cout << ans[i] << endl;
	
	return 0;
}

Submission Info

Judge Result