# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831438 | rainboy | LOSTIKS (INOI20_lostiks) | C11 | 1604 ms | 246508 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 M 20
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int n, m;
int *ej[N], *eg[N], eo[N];
int uu[M], vv[M];
void append(int i, int j, int g) {
int o = eo[i]++;
if (o >= 2 && (o & o - 1) == 0) {
ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
eg[i] = (int *) realloc(eg[i], o * 2 * sizeof *eg[i]);
}
ej[i][o] = j, eg[i][o] = g;
}
int dd[N], pp[N], qq[N], bb[N];
int dfs1(int p, int i, int d, int b) {
int o, s, k_, 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... |