oj.uz

Submission #121029

# Submission time Handle Problem Language Result Execution time Memory
121029 2019-06-26T03:20:20 Z IOrtroiii Alternating Current (BOI18_alternating) C++14
0 / 100
 72 ms 3304 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2164 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 13 ms 1788 KB Output is correct
4 Correct 16 ms 1912 KB Output is correct
5 Correct 37 ms 3064 KB Output is correct
6 Correct 31 ms 3180 KB Output is correct
7 Correct 33 ms 3056 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 72 ms 3304 KB Output is correct
11 Correct 31 ms 2936 KB Output is correct
12 Correct 34 ms 3184 KB Output is correct
13 Incorrect 2 ms 384 KB no wires in direction 0 between segments 100000 and 100000
14 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -