oj.uz

답안 #312148

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312148 2020-10-12T13:41:37 Z AmineTrabelsi Traffic (IOI10_traffic) C++14
0 / 100
 15 ms 23808 KB 
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define pb push_back 
#define mp make_pair
#define f first
#define s second
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

// Hi
const int M = 1e6;
vector<int> gr[M];
int *people;
ll dfs(int i,int par){
	ll res = 0;
	for(auto u:gr[i]){
		if(u!= par){
			res += people[u] + dfs(u,i);
		}
	}
	return res;
}
ll LocateCentre(int n,int p[],int ff[],int d[]){
	for(int i=0;i<n-1;i++){
		gr[ff[i]].pb(d[i]);
		gr[d[i]].pb(ff[i]);
	}
	people = p;
	ll res = 1e18;
	int city = 0;
	for(int i=0;i<n;i++){
		ll x = dfs(i,i);
		if(x < res){
			res = x;
			city = i;
		}
	}
	return city;
}
/*
int main(){
	int p[5] = {10,10,10,20,20},s[4] = {0,1,2,3},d[4] = {1,2,3,4};
	cout<<LocateCentre(5,p,s,d)<<'\n';
	return 0;
}
*/

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Incorrect 15 ms 23808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Incorrect 15 ms 23808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Incorrect 15 ms 23808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Incorrect 15 ms 23808 KB Output isn't correct
3 Halted 0 ms 0 KB -