# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340092 | Hazem | Putovanje (COCI20_putovanje) | C++14 | 288 ms | 44140 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.
/*
ID: tmhazem1
LANG: C++14
TASK: pprime
*/
#include <bits/stdc++.h>
using namespace std;
#define S second
#define F first
#define LL long long
const int N = 2e5 + 10;
LL LINF = 100000000000000000;
LL INF = 1000000000;
LL par[N][30],pr[N],depth[N];
vector<pair<int,pair<LL,LL>>>adj[N];
void dfs(int i,int pre){
par[i][0] = pre;
for(int j=1;j<=20;j++)
par[i][j] = par[par[i][j-1]][j-1];
for(auto x:adj[i])
if(x.F==pre)continue;
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... |