# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223200 | cheeheng | Putovanje (COCI20_putovanje) | C++14 | 534 ms | 42232 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 <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
map<int, ii> EdgeW[200005];
vector<int> AdjList[200005];
static int heavy[200005];
static int depth[200005];
static int head[200005];
static int p[200005];
static int pos[200005];
static int sz[200005];
int cnt = 0; ///set to 1 if you're using fenwick tree
long long A[200005];
long long val[(1<<19)+5];
long long lazyadd[(1<<19)+5];
int N;
inline int left1(int x){
return (x<<1)+1;
}
inline int right1(int x){
return (x<<1)+2;
}
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... |