# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102660 | sean9892 | 두 로봇 (KOI18_robot) | C++14 | 1091 ms | 188000 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>
using namespace std;
int main(void){
int n,s,e;
scanf("%d%d%d",&n,&s,&e);
map<pair<int,int>,int> adj;
for(int i=0;i<n-1;i++){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
adj[{a,b}]=adj[{b,a}]=c;
}
stack<int> st;
st.push(s);st.push(0);
int root[n+1];
memset(root,0,sizeof(root));
while(!st.empty()){
int b=st.top();st.pop();
int t=st.top();st.pop();
root[t]=b;
if(e==t){
break;
}
for(int i=1;i<=n;i++){
if(!root[i]&&adj[{i,t}]){
st.push(i);st.push(t);
}
}
}
int p=e;
int m=0;
int rl=0;
for(;p!=s;p=root[p]){
int x=adj[{p,root[p]}];
m=m>x?m:x;
rl+=x;
}
printf("%d",rl-m);
}
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... |