# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
705246 | rainboy | Prize (CEOI22_prize) | C11 | 1961 ms | 237084 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>
#include <string.h>
#define N 1000000
#define Q 100000
unsigned int X = 12345;
int rand_() {
return (X *= 3) >> 1;
}
int t;
int *ej[2][N], eo[2][N], dd[2][N], pp[2][N], qq[2][N], sz[2][N], ta[2][N], tb[2][N], rr[2];
void append(int i, int j) {
int o = eo[t][i]++;
if (o >= 2 && (o & o - 1) == 0)
ej[t][i] = (int *) realloc(ej[t][i], o * 2 * sizeof *ej[t][i]);
ej[t][i][o] = j;
}
int dfs1(int p, int i, int d) {
int o, s, k_, j_;
dd[t][i] = d, pp[t][i] = p;
s = 1, k_ = 0, j_ = -1;
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... |