제출 #328513

#제출 시각아이디문제언어결과실행 시간메모리
328513chubyxdxdSjekira (COCI20_sjekira)C++11
40 / 110
75 ms620 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> ii; vector<vector<ll>> G,aux; ll val[1010]; ll dfs(int node,int pad){ ll ans=val[node]; for(auto i:aux[node]){ if(i==pad)continue; ans=max(ans,dfs(i,node)); } return ans; } int main(){ int n; vector<ii> v; ll a,b; cin>>n; for(int i=1;i<=n;i++){ cin>>val[i]; v.push_back(ii(val[i],i)); } sort(v.rbegin(),v.rend()); G.assign(n+2,vector<ll>()); for(int i=0;i<n-1;i++){ cin>>a>>b; G[a].push_back(b); G[b].push_back(a); } // cout<<123<<endl; ll ans=0; for(int i=0;i<n;i++){ aux=G; vector<vector<ll>> gg; for(int j=0;j<aux[v[i].second].size();j++){ ans+=v[i].first; ans+=dfs(aux[v[i].second][j],v[i].second); } //cout<<ans<<endl; gg.push_back(vector<ll>()); for(int j=1;j<=n;j++){ gg.push_back(vector<ll>()); //cout<<123<<endl; for(int l=0;l<aux[j].size();l++){ //cout<<aux[j][l]<<" "<<v[i].second<<endl; //cout<<123<<endl; if(aux[j][l]==v[i].second)continue; // cout<<gg[j].size()<<endl; gg[j].push_back(aux[j][l]); } } // cout<<123<<endl; gg[v[i].second].clear(); G=gg; } cout<<ans<<endl; }

컴파일 시 표준 에러 (stderr) 메시지

sjekira.cpp: In function 'int main()':
sjekira.cpp:37:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int j=0;j<aux[v[i].second].size();j++){
      |                 ~^~~~~~~~~~~~~~~~~~~~~~~~
sjekira.cpp:46:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |       for(int l=0;l<aux[j].size();l++){
      |                   ~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...