제출 #638422

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
638422		ojoConmigo	Traffic (IOI10_traffic)	C++17	100 / 100	1093 ms	178532 KiB

traffic

#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> g;
vector<long long> ans,subarbol;

void dfs1(int nodo, int p, int pp[]){
   subarbol[nodo] = pp[nodo];
   for(int v : g[nodo]){
      if(v == p)continue;
      dfs1(v,nodo,pp);
      subarbol[nodo] += subarbol[v];
   }
}

void dfs2(int nodo, int p, int pp[]){
   ans[nodo] = subarbol[0] - subarbol[nodo];
   for(int v : g[nodo]){
      if(v == p)continue;
      ans[nodo] = max(ans[nodo],subarbol[v]);
      dfs2(v,nodo,pp);
   }
}

int LocateCentre(int N, int pp[], int S[], int D[]) {
   g.resize(N);
   for(int i=0; i<N-1; i++){
      int x,y;
      x = S[i]; y = D[i];
      //cout << x << " " << y << endl;
      g[x].push_back(y);
      g[y].push_back(x);
   }
   subarbol.assign(N,0);
   ans.resize(N);
   dfs1(0,-1,pp);
   dfs2(0,-1,pp);
   int arena = 0;
   long long congestion = 2e9 + 1;
   for(int i=0; i<N; i++){
      //cout << i << " " << ans[i] << " " << congestion << endl;
      if(ans[i] < congestion){
         congestion = ans[i];
         arena = i;
      }
   }
   //cout << arena << endl;
   return arena;
   /*
   long long pre[N];
   pre[0] = pp[0];
   for(int i=1; i<N; i++){
      pre[i] = pre[i-1] + pp[i];
   }
   int sol = 0;
   long long congestion = pre[N-1] - pre[0];
   for(int i=1; i<N; i++){
      long long mayor = (pre[i-1] > pre[N-1] - pre[i] ? pre[i-1] : pre[N-1] - pre[i]);
      //cout << mayor << endl;
      if(mayor < congestion){
         congestion = mayor;
         sol = i;
      }
   }
   return sol;
   */
}

/*
int main(){
   int n;
   cin >> n;
   int pp[n],s[n-1],d[n-1];
   for(int i=0; i<n; i++){
      cin >> pp[i];
   }
   for(int i=0; i<n-1; i++){
      cin >> s[i] >> d[i];
   }
   cout << LocateCentre(n,pp,s,d) << endl;
}
*/

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25