# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
949132 | ting39 | Two Currencies (JOI23_currencies) | C++17 | 486 ms | 40028 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 int long long
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
vector<vector<int>> g,jump;
vector<int> dep,dis,c;
int cost;
void dfs(int pre,int pos){
for(int i:g[pos]){
if(i==pre) continue;
jump[i][0]=pos;
dep[i]=dep[pos]+1;
dis[i]=dis[pos]+c[i];
dfs(pos,i);
}
}
int lca(int x,int y){
if(dep[x]<dep[y]){
swap(x,y);
}
int diff=dep[x]-dep[y],cnt=0;
while(diff){
if(diff&1){
x=jump[x][cnt];
}
cnt++;
diff>>=1;
}
# | 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... |