제출 #207752

#제출 시각아이디문제언어결과실행 시간메모리
207752shihan04구슬과 끈 (APIO14_beads)C++17
0 / 100
6 ms504 KiB
#include<bits/stdc++.h> using namespace std; int main() { int n,a,b,c,x=0,t=0; cin>>n; vector <int> node[n+1],N(n+1,0),v; map <pair<int,int>,int> m; for(int i=0;i<n-1;i++){ cin>>a>>b>>c; node[a].push_back(b); node[b].push_back(a); N[a]++; N[b]++; t+=c; m.insert(make_pair(make_pair(a,b),c)); m.insert(make_pair(make_pair(b,a),c)); } for(int i=1;i<=n;i++){ if(N[i]==1){ x++; v.push_back(m[make_pair(i,node[i][0])]); } } sort(v.begin(),v.end()); int l=2*x-n-1; if(l<0){ l=1; } for(int i=0;i<l;i++){ t-=v[i]; } cout<<t; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...