Submission #1691530

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,m,a,b,s[200010];

int main(){
	cin >> n >> m;
	
	REP(i,0,m){
		cin >> a >> b;
		s[a]++; s[b+1]--;
	}
	
	REP(i,0,n){
		s[i+1]+=s[i];
		cout << (s[i+1]%2?1:0);
	}
	
	cout << endl;
	return 0;
}

Submission Info

Judge Result