Submission #121029

#	Time	Username	Problem	Language	Result	Execution time	Memory
121029		IOrtroiii	Alternating Current (BOI18_alternating)	C++14	0 / 100	72 ms	3304 KiB

alternating

#include <bits/stdc++.h>

using namespace std;

const int N = 100100;

int color[N];

int main() {
   ios_base::sync_with_stdio(false);
   int n, m;
   cin >> n >> m;
   vector<tuple<int, int, int>> vals;
   for (int i = 1; i <= m; ++i) {
      int l, r;
      cin >> l >> r;
      assert(l <= r);
      vals.emplace_back(l, -r, i);
   }
   sort(vals.begin(), vals.end());
   int gol = 0;
   int gor = 0;
   for (auto v : vals) {
      int l, r, id;
      tie(l, r, id) = v;
      r = -r;
      if (gol < gor) {
         if (l > gol + 1) {
            puts("impossible");
            return 0;
         }
         color[id] = 0;
         gol = max(gol, r);
      } else {
         if (l > gor + 1) {
            puts("impossible");
            return 0;
         }
         color[id] = 1;
         gor = max(gor, r);
      }
   }
   for (int i = 1; i <= m; ++i) {
      printf("%d", color[i]);
   }
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 22
• Subtask 4: 0 / 19
• Subtask 5: 0 / 26