# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108534 | E869120 | Amusement Park (JOI17_amusement_park) | C++14 | 1119 ms | 4264 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 "Joi.h"
#include <iostream>
#include <vector>
using namespace std;
vector<int>G[10009]; int col[10009], v[20009], cnts;
void make_ransuu1(int B) {
for (int i = 0; i < B; i++) v[i] = i;
unsigned long long x = 2285;
for (int i = 0; i < 1000000; i++) {
x ^= x << 13;
x ^= x >> 7;
x ^= x << 17;
int u1 = (x % B);
x ^= x << 13;
x ^= x >> 7;
x ^= x << 17;
int u2 = (x % B);
swap(v[u1], v[u2]);
}
}
void dfs(int pos) {
if (col[pos] >= 0) return;
col[pos] = cnts % 60; cnts++;
for (int i = 0; i < G[pos].size(); i++) dfs(G[pos][i]);
}
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... |