# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587258 | rainboy | Naboj (COCI22_naboj) | C11 | 386 ms | 25088 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 <stdlib.h>
#define N 200000
#define M 500000
int ij[M];
int *eh[N], eo[N];
void append(int i, int h) {
int o = eo[i]++;
if (o >= 2 && (o & o - 1) == 0)
eh[i] = (int *) realloc(eh[i], o * 2 * sizeof *eh[i]);
eh[i][o] = h;
}
char visited[N]; int dd[N][2], ii[N], cc[N], cnt;
void dfs(int i) {
int o;
if (visited[i] || dd[i][0] > 0 && dd[i][1] > 0)
return;
visited[i] = 1;
ii[cnt] = i, cc[cnt] = dd[i][0] == 0 ? 0 : 1, cnt++;
for (o = eo[i]; o--; ) {
int h = eh[i][o], j = i ^ ij[h >> 1];
dd[j][h & 1 ^ 1]--, dfs(j);
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... |