# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1066752 | sleepntsheep | Alternating Current (BOI18_alternating) | C++17 | 12 ms | 1372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
using iii = pair<pair<int, int>, int>;
int n, m;
char ans[1<<18];
iii a[1<<18];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) scanf("%d%d", &a[i].first.first, &a[i].first.second);
sort(a, a + m);
int e1 = 0, e2 = 0;
for (int j = 0, i = 1; i <= n; ++i) {
while (j < m and a[j].first.first == i) {
if (e1 <= e2) {
e1 = max(e1, a[j].first.second);
ans[a[j].second] = '1';
} else {
e2 = max(e2, a[j].first.second);
ans[a[j].second] = '0';
}
++j;
}
if (e1 + 1 < i or e2 + 1 < i) {
puts("impossible");
return 0;
}
}
puts(ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |