# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531898 | rainboy | Synchronization (JOI13_synchronization) | C11 | 2054 ms | 140228 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 100000
#define M 200000
#define LG 18 /* LG = ceil(log2(M)) */
#define N_ (1 + M * 2 * (LG * 2 + 3))
unsigned int X = 12345;
int rand_() {
return (X *= 3) >> 1;
}
int ij[N - 1];
int *eh[N], eo[N], *eg[N - 1], eo_[N - 1], n, k;
void append(int **eh, int *eo, 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;
}
void delete(int i, int h) {
int o;
for (o = eo[i]; o--; )
if (eh[i][o] == h) {
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... |