oj.uz

Submission #100825

# Submission time Handle Problem Language Result Execution time Memory
100825 2019-03-14T19:29:22 Z RafaelSus Race (IOI11_race) C++14
9 / 100
 3000 ms 13184 KB 
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int n,k;
bool used[200002], used_1[200002], used_2[200002];
vector<pair<int,int>>g[200002];
int size[200002];
int tree_centroid;
int best[200002];
const int inf = 1e9;
int ans = 1e9;

void dfs(int node, int dad = -1)
{
	size[node] = 1;
	for (auto it : g[node])
		if (!used[it.first] && it.first != dad)
		{
			dfs(it.first, node);
			size[node] += size[it.first];
		}
}


void findcentroid(int v, int flo){
	used_1[v]=true;
	int zib=0;
	for(auto x:g[v]){
		if(used_1[x.first])continue;
		if(size[x.first] - 1 >= flo){
			zib++;
			findcentroid(x.first, flo);
			break;
		}
	}
	if(zib==0)
		tree_centroid=v;
}

void dfs2(int x, int p, int cost, int l, vector<pair<int,int>>&to_ans) {
	if (cost <= k) 
		to_ans.push_back(make_pair(cost, l));

	for (auto y : g[x]) {
		if (used_2[y.first] || y.first == p)continue;
		dfs2(y.first, x, cost + y.second, l + 1, to_ans);
	}
}


int solve(int node) {
	dfs(node);
	fill(used_1, used_1 + n, false);
	int zibil = size[node] - 1;
	findcentroid(node, zibil / 2);
	node = tree_centroid;
	best[0] = 0;

	vector<int>del;
	vector<pair<int, int>>to_ans;

	for (auto x : g[node]) {
		int son = x.first;
		if (used_2[son])continue;
		to_ans.clear();
		dfs2(x.first, node, x.second, 1, to_ans);

		for (auto it : to_ans)
			ans = min(ans, it.second + best[k - it.first]);


		for (auto it : to_ans)
		{
			best[it.first] = min(best[it.first], it.second);
			del.push_back(it.first);
		}
	}
	for (auto it : del)
		best[it] = inf;

	used_2[node] = true;


	for (auto it : g[node])
		if (!used_2[it.first])
			ans = min(ans, solve(it.first));

	return ans;
}


int best_path(int N, int _K, int H[][2], int L[])
{
    k = _K;
    int i;
    for(i=0; i<N-1; ++i)
    {
        int x, y, z;
        x = H[i][0];
        y = H[i][1];
        z = L[i];

        g[x].push_back(make_pair(y,z));
        g[y].push_back(make_pair(x,z));
    }
 
    for(i=0; i<=k; ++i) best[i] = inf;
 
    int X = solve(0);
    if(X == inf) return -1;
    return X;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 6 ms 5092 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 9 ms 5120 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 6 ms 5092 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 9 ms 5120 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Correct 6 ms 4992 KB Output is correct
20 Correct 6 ms 5092 KB Output is correct
21 Correct 16 ms 5120 KB Output is correct
22 Runtime error 17 ms 13184 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 6 ms 5092 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 9 ms 5120 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Execution timed out 3005 ms 12752 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 6 ms 5092 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 9 ms 5120 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Correct 6 ms 4992 KB Output is correct
20 Correct 6 ms 5092 KB Output is correct
21 Correct 16 ms 5120 KB Output is correct
22 Runtime error 17 ms 13184 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -