Submission #3444396

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <map>
#include <stack>
#include <string>
#include <list>
#include <deque>
#include <math.h>
using namespace std;

typedef pair<int, int> P;
#define ll long long
#define int ll
#define INF (1LL<<30)

int N, Q;
int a[200001];

signed main(){
	cin >> N >> Q;
	for (int i = 0; i < Q; i++){
		int l, r;
		cin >> l >> r;
		a[l]++;
		a[r + 1]--;
	}
	for (int i = 1; i <= N; i++)
		a[i] = a[i - 1] + a[i];

	for (int i = 1; i <= N; i++){
		if (a[i] % 2==0) cout << "0";
		else cout << "1";
	}
	cout << endl;

	return 0;
}

Submission Info

Judge Result