# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138032 | Psiuk_Yurii | Putovanje (COCI20_putovanje) | C++20 | 74 ms | 42632 KiB |
/*In FISH at EGOI25 I trust*/
/*In FISH at EGOI25 I trust*/
/*In FISH at EGOI25 I trust*/
/*In FISH at EGOI25 I trust*/
/*In FISH at EGOI25 I trust*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppl;
struct edge{
ll to,a,b;
};
ll n,v1,v2,a,b,dv[200009][29],h,timer,tin[200009],tout[200009],d[200009],c[200009],res;
vector<edge> A[200009];
void dfs(int v,int par){
timer++;
tin[v]=timer;
dv[v][0]=par;
d[v]=d[par]+1;
for(int i=1;i<=h;i++) dv[v][i]=dv[dv[v][i-1]][i-1];
for(auto x:A[v]) {
if(x.to==par) continue;
dfs(x.to,v);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |