# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
262016 | patrikpavic2 | Mergers (JOI19_mergers) | C++17 | 87 ms | 34544 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 <cstdio>
#include <cstdlib>
#include <vector>
#define PB push_back
using namespace std;
const int N = 5e5 + 500;
vector < int > v[N], v2[N];
int A[N], kol[N], siz[N], sol, bio[N], bla, n;
int hsh[N], par[N], zad[N];
inline int pr(int x){
if(x == par[x]) return x;
return par[x] = pr(par[x]);
}
inline void mrg(int x, int y){
par[pr(x)] = pr(y);
}
int dfs(int x, int lst){
int ret = hsh[x];
for(int y : v[x]){
if(y == lst) continue;
ret += dfs(y, x);
}
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... |