| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 480101 | rainboy | Trobojnica (COCI19_trobojnica) | C11 | 47 ms | 3552 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>
#define N 200000
int main() {
static char cc[N + 1];
static int kk[4], ii[N];
int n, i, x, cnt;
scanf("%d%s", &n, cc);
x = 0;
for (i = 0; i < n; i++) {
cc[i] -= '0';
kk[(int) cc[i]]++;
x ^= cc[i];
}
if (x != 0 || kk[1] == n || kk[2] == n || kk[3] == n) {
printf("NE\n");
return 0;
}
cnt = 0;
ii[cnt++] = 0;
printf("DA\n");
for (i = 1; i < n; i++) {
int a, b;
while (cnt >= 2 && (a = cc[ii[cnt - 2]]) != (b = cc[ii[cnt - 1]]) && (kk[a] > 1 || kk[b] > 1)) {
kk[a]--, kk[b]--, kk[a ^ b]++, cnt--;
cc[ii[cnt - 1]] = a ^ b;
printf("%d %d %d\n", ii[cnt - 1] + 1, i + 1, a ^ b);
}
ii[cnt++] = i;
}
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... | ||||
