# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440327 | raid | Fountain (eJOI20_fountain) | C++17 | 971 ms | 28244 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 <iostream>
#include <vector>
using namespace std;
const int MAXN = 100005;
const int MAXLOG = 18;
struct rsv {
int diam, vol;
} v[MAXN];
vector<int> s;
vector<int> G[MAXN];
int S[MAXN];
int anc[MAXLOG][MAXN];
int lg2[MAXN], lev[MAXN], w[MAXN];
inline int getAnc( int node, int k ) {
int lg = lg2[k];
while ( k ) {
node = anc[lg][node];
k -= (1 << lg);
lg = lg2[k];
}
return node;
}
void DFS( int node, int dep ) {
w[node] = 1;
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... |