oj.uz

Submission #372758

# Submission time Handle Problem Language Result Execution time Memory
372758 2021-03-01T13:30:33 Z Drew_ Traffic (IOI10_traffic) C++14
0 / 100
 1 ms 364 KB 
#include "traffic.h"
#include <iostream>
#include <vector>
#include <functional>
using namespace std;

#define pb push_back

int LocateCentre(int N, int P[], int S[], int D[])
{
	vector<vector<int>> adj(N);
	for (int i = 0; i < N-1; ++i)
		adj[S[i]].pb(D[i]), adj[D[i]].pb(S[i]);

	vector<int> sz(N, 0);
	vector<bool> vst(N, false);

	function<int(int)> dfs = [&](int node)
	{
		vst[node] = true;
		sz[node] = P[node];
		for (int to : adj[node])
		{
			if (!vst[to])
				sz[node] += sz[to];
		}
		return sz[node];
	};
	dfs(0);

	int res = -1;
	int best = 2e9 + 7;
	for (int node = 0; node < N; ++node)
	{
		int tmp = 0;
		for (int to : adj[node])
		{
			int ctr = sz[to];
			if (sz[to] > sz[node])
				ctr = sz[0] - sz[node];
			tmp = max(tmp, ctr);
		}
		if (best > tmp)
		{
			best = tmp;
			res = node;
		}
	}
	return res;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -