# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731736 | rainboy | Fire drill (LMIO18_sauga) | C11 | 0 ms | 0 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 <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define N 1000
#define MD 0x7fffffff
int *ej[N], *ed[N], eo[N];
void append(int i, int j, int d) {
int o = eo[i]++;
if (o >= 2 && (o & o - 1) == 0) {
ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
ed[i] = (int *) realloc(ed[i], o * 2 * sizeof *ed[i]);
}
ej[i][o] = j, ed[i][o] = d;
}
int ii[N], pp[N], dd[N], c, c_;
void swap(int i, int j) {
int p = pp[i], q = pp[j], o;
for (o = eo[i]; o--; ) {
int k = ej[i][o], d = ed[i][o];
if (d == 0) {
if (pp[i] < pp[k] && --dd[i] == 0)