# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24296 | jiaqiyang | Port Facility (JOI17_port_facility) | C++14 | 2383 ms | 1040064 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 <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
int nextInt() {
char ch;
while (!isdigit(ch = getchar())) {}
int res = ch - '0';
while (isdigit(ch = getchar())) res = 10 * res + ch - '0';
return res;
}
const int N = 2000000 + 10, S = 40 * N, MOD = 1000000007;
int n, a[N], b[N], c[N], id[N];
int adj[N], to[S], next[S];
void link(int a, int b) {
static int cnt = 2;
to[cnt] = b;
next[cnt] = adj[a];
adj[a] = cnt++;
}
int buffer[S], *pool[N];
void update(int p, int v) {
for (; p <= 2 * n; p += p & -p) pool[p][++pool[p][0]] = v;
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... |