Submission #3006417

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<math.h>
#include<set>
#include<vector>
#include<map>
#include<functional>
#include<iomanip>
#include<queue>
#include<random>
#include<numeric>
#include<string>
#include<stack>
#include<cstring>
typedef long long ll;
typedef long double ld;
using namespace std;
ll dx[] = { 0,0,1,-1 };
ll dy[] = { 1,-1,0,0 };

ll gcd(ll a, ll b) {
	if (a<b) { return gcd(b, a); }
	else if (a%b) { return gcd(b, a%b); }
	else { return b; }
}
ll lcm(ll a, ll b) {
	return a / gcd(a, b)*b;
}
int main() {
	ll table[200001];
	ll N, M;
	cin >> N >> M;
	for (ll i = 0; i < N; i++) {
		table[i] = 0;
	}
	for (ll i = 0; i < M; i++) {
		ll l, r;
		cin >> l >> r;
		l--; r--;
		table[l]++;
		table[r+1]--;
	}
	for (ll i = 0; i < N; i++) {
		if (i > 0)
			table[i] += table[i - 1];
	}
	for (ll i = 0; i < N; i++) {
		if (table[i] % 2 == 0)
			cout << 0;
		else
			cout << 1;
	}
}

Submission Info

Judge Result