Submission #675770

---

Source Code Expand

#include <algorithm>
#include <array>
#include <complex>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

inline bool valid(const int x, const int r) { return 0 <= x && x < r; }

void initIOStream() {
  ios::sync_with_stdio(false); // stdinなどと同期しない
  cin.tie(0); // cinの前にflushしない
  cout.setf(ios::fixed);
  cout.precision(10); // 四捨五入して指定桁数表示
}

int main() {
  initIOStream();

  int N, Q;
  cin >> N >> Q;

  vector<int> s(2*Q+2);

  for(int i = 0; i < Q; ++i) {
    int l, r;
    cin >> l >> r;
    --l;
    s[2*i] = l;
    s[2*i+1] = r;
  }
  s[2*Q] = 0;
  s[2*Q+1] = N;
  sort(s.begin(), s.end());

  int pos = 0;
  int e = 0;
  string ans;
  ans.resize(N);
  for(int i = 1, size = s.size(); pos < N && i < size;) {
    while(i < size && pos == s[i]){
      ++i;
      e ^= 1;
    }
    ans[pos] = (e == 0 ? '0' : '1');
    ++pos;
  }
  cout << ans << endl;
}

Submission Info

Judge Result