제출 #232632

#제출 시각아이디문제언어결과실행 시간메모리
232632crossing0verTraffic (IOI10_traffic)C++17
0 / 100
18 ms23936 KiB
#include<bits/stdc++.h> //#include "grader.h" using namespace std; int dp[1000006], C[1000006] , tot; vector <int> adj[1000005]; void dfs(int v,int p) { dp[v] = 0; int s = 0; int r = 0; for (int i:adj[v]) { if (i != p) { dfs (i,v); dp[v] = max(dp[v], dp[i] + C[i]); } } } int LocateCentre(int n,int P[],int S[],int D[]) { for (int i = 0; i < n-1; i++) adj[S[i]].push_back(D[i]), adj[D[i]].push_back(S[i]), C[i] = P[i], tot += C[i]; pair<int,int> ans = {INT_MAX,-1}; for (int i = 0; i < n; i++) { dfs(i,-1); ans = min(ans,{dp[i],i}); } return ans.second; }

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

traffic.cpp: In function 'void dfs(int, int)':
traffic.cpp:8:6: warning: unused variable 's' [-Wunused-variable]
  int s = 0;
      ^
traffic.cpp:9:6: warning: unused variable 'r' [-Wunused-variable]
  int r = 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...