제출 #1041847

#제출 시각아이디문제언어결과실행 시간메모리
1041847MMihalev구슬과 끈 (APIO14_beads)C++14
컴파일 에러
0 ms0 KiB
#include<iostream> #include<algorithm> #include<iomanip> #include<cmath> #include<cstring> #include<vector> #include<queue> #include<stack> #include<tuple> #include<set> #include<map> #include<random> #include<chrono> #pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") using namespace std; const short MAX_N=1e4+1; const int INF=2e9+1e8; int dp[MAX_N][2]; short n; vector<pair<short,short>>g[MAX_N]; short j; void reset() { for(j=1;j<=n;++j) { dp[i][0]=0; dp[i][1]=-INF; } } void dfs(short u,short par) { int sum=0,cur; for(auto [v,edge]:g[u]) { if(v==par)continue; dfs(v,u); sum+=max(edge+dp[v][1],dp[v][0]); } for(auto [v,edge]:g[u]) { if(v==par)continue; cur=max(edge+dp[v][1],dp[v][0]); dp[u][1]=max(dp[u][1],sum-cur+edge+dp[v][0]); } dp[u][0]=sum; } signed main () { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin>>n; for(short i=1;i<n;i++) { short u,v,c; cin>>u>>v>>c; g[u].push_back({v,c}); g[v].push_back({u,c}); } int ans=0; short r; for(r=1;r<=n;++r) { reset(); dfs(r,0); ans=max(ans,dp[r][0]); } cout<<ans<<"\n"; return 0; }

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

beads.cpp: In function 'void reset()':
beads.cpp:27:12: error: 'i' was not declared in this scope
   27 |         dp[i][0]=0;
      |            ^
beads.cpp: In function 'void dfs(short int, short int)':
beads.cpp:35:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |     for(auto [v,edge]:g[u])
      |              ^
beads.cpp:43:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   43 |     for(auto [v,edge]:g[u])
      |              ^