# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
878962 | 2023-11-25T19:58:58 Z | sabukatsire | Traffic (IOI10_traffic) | C++17 | 8 ms | 31068 KB |
#include<bits/stdc++.h> using namespace std; #include "traffic.h" vector<int> v[1000001]; int sz[1000001],ans = 200000000000,idx; void dfs(int curr,int pp,int sum){ int mx = 0; for(int j=0;j<v[curr].size();j++){ if(v[curr][j] == pp) continue; dfs(v[curr][j],curr,sum); sz[curr] += sz[v[curr][j]]; mx = max(sz[v[curr][j]],mx); } mx = max(mx,sum-sz[curr]); if(ans > mx){ ans = mx; idx = curr; } } int LocateCentre(int n,int p[1000001],int s[1000001],int d[1000001]){ int sum = 0; for(int i=0;i<n;i++) v[i].clear(); for(int i=0;i<n;i++){ v[s[i]].push_back(d[i]); v[d[i]].push_back(s[i]); sz[i] = p[i]; sum += p[i]; } dfs(0,0,sum); return idx; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 31068 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 31068 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 31068 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 31068 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |