# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229235 | VEGAnn | Putovanje (COCI20_putovanje) | C++14 | 145 ms | 27384 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>
#define sz(x) ((int)x.size())
#define pii pair<int,int>
#define ft first
#define sd second
#define all(x) x.begin(),x.end()
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
const int N = 200100;
const int PW = 20;
vector<int> vc, g[N];
int U[N], V[N], C1[N], C2[N], kol[N], n, pr[N][PW], V1[N], V2[N];
int tin[N], tout[N], tt = 0, ad[N];
ll ans = 0, sm[N];
void dfs(int v, int p){
tin[v] = tt++;
pr[v][0] = p;
for (int po = 1; po < PW; po++)
pr[v][po] = pr[pr[v][po - 1]][po - 1];
for (int nm : g[v]){
int u = (U[nm] == v ? V[nm] : U[nm]);
if (u == p) continue;
V1[u] = C1[nm];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |