oj.uz

답안 #101205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
101205 2019-03-17T13:47:50 Z davitmarg 경주 (Race) (IOI11_race) C++17
43 / 100
 3000 ms 58032 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>  
#include <cassert>
#include <fstream>

#ifndef death
#include "race.h"
#endif

#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int n, k, num[200005], used[200005], usedNum[200005], usedC[200005],wasC[200005],color=1,cColor=1,numColor=1, ans = mod;
vector<pair<int, LL>> g[200005],upd;
map<LL, int> dp;
void getNum(int v)
{
	usedNum[v] = numColor;
	num[v] = 1;
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i].first;
		if (usedNum[to] == numColor || wasC[to])
			continue;
		getNum(to);
		num[v] += num[to];
	}
}

int centroid(int v)
{
	numColor++;
	cColor++;
	getNum(v);
	int st = v;
	queue<int> q;
	q.push(v);
	while (!q.empty())
	{
		v = q.front();
		q.pop();
		usedC[v] = cColor;
		bool is = 1;
		for(int i=0;i<g[v].size();i++)
			if (num[g[v][i].first]>num[st]/2 && usedC[g[v][i].first] != cColor && !wasC[g[v][i].first])
			{
				is = 0;
				q.push(g[v][i].first);
			}
		if (is)
		{
			wasC[v]=1;
			return v;
		}
	}
}

void dfs(int v,LL sum,int depth)
{
	used[v] = color;

	if (dp[sum] == 0)
		dp[sum] = mod;
	if (k > sum && dp[k - sum] == 0)
		dp[k - sum] = mod;

	upd.PB(MP(depth, sum));

	if (sum == k)
		ans = min(ans, depth);
	else if (sum < k)
		ans = min(ans, depth + dp[k - sum]);

	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i].first;
		LL D = g[v][i].second;
		if (used[to] == color || wasC[to])
			continue;
		dfs(to, sum + D, depth + 1);
	}
}

void solve(int v)
{
	dp.clear();
	color++;
	vector<int> nxt;
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i].first;
		LL D = g[v][i].second;
		if (used[to] == color || wasC[to])
			continue;

		upd.clear();
		dfs(to, D, 1);
		for (int j = 0; j < upd.size(); j++)
			dp[upd[j].second] = min(dp[upd[j].second], upd[j].first);
		nxt.PB(to);
	}
	for (int i = 0; i < nxt.size(); i++)
		solve(centroid(nxt[i]));
}

int Main()
{
	solve(centroid(1));
	if (ans == mod)
		ans = -1;
	return 0;
}

int best_path(int N, int K, int h[][2], int l[])
{
	n = N;
	k = K;
	for (int i = 0; i < n-1; i++)
	{
		h[i][0]++;
		h[i][1]++;
		g[h[i][0]].PB(MP(h[i][1], l[i]));
		g[h[i][1]].PB(MP(h[i][0], l[i]));
	}
	Main();
	return ans;
}

#ifdef death
int main()
{
	cin >> n >> k;

	for (int i = 0; i < n - 1; i++)
	{
		int a, b;
		LL D;
		cin >> a >> b >> D;
		/*a = i;
		b = a + 1;
		D = rand() % 20;*/
		a++;
		b++;
		g[a].PB(MP(b, D));
		g[b].PB(MP(a, D));
	}
	Main();
	cout << ans << endl;
	return 0;
}
#endif

/*

*/

Compilation message

race.cpp: In function 'void getNum(int)':
race.cpp:38:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++)
                  ~~^~~~~~~~~~~~~
race.cpp: In function 'int centroid(int)':
race.cpp:62:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<g[v].size();i++)
               ~^~~~~~~~~~~~
race.cpp: In function 'void dfs(int, long long int, int)':
race.cpp:92:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++)
                  ~~^~~~~~~~~~~~~
race.cpp: In function 'void solve(int)':
race.cpp:107:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++)
                  ~~^~~~~~~~~~~~~
race.cpp:116:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < upd.size(); j++)
                   ~~^~~~~~~~~~~~
race.cpp:120:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < nxt.size(); i++)
                  ~~^~~~~~~~~~~~
race.cpp: In function 'int centroid(int)':
race.cpp:74:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 8 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 9 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5196 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 8 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 9 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5196 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 6 ms 5120 KB Output is correct
21 Correct 9 ms 5248 KB Output is correct
22 Correct 10 ms 5248 KB Output is correct
23 Correct 9 ms 5248 KB Output is correct
24 Correct 9 ms 5248 KB Output is correct
25 Correct 10 ms 5248 KB Output is correct
26 Correct 10 ms 5220 KB Output is correct
27 Correct 9 ms 5120 KB Output is correct
28 Correct 9 ms 5248 KB Output is correct
29 Correct 9 ms 5248 KB Output is correct
30 Correct 13 ms 5248 KB Output is correct
31 Correct 10 ms 5248 KB Output is correct
32 Correct 13 ms 5248 KB Output is correct
33 Correct 11 ms 5312 KB Output is correct
34 Correct 13 ms 5248 KB Output is correct
35 Correct 12 ms 5248 KB Output is correct
36 Correct 1 ms 5248 KB Output is correct
37 Correct 9 ms 5248 KB Output is correct
38 Correct 10 ms 5248 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 8 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 9 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5196 KB Output is correct
19 Correct 489 ms 14200 KB Output is correct
20 Correct 501 ms 14200 KB Output is correct
21 Correct 508 ms 14196 KB Output is correct
22 Correct 477 ms 14168 KB Output is correct
23 Correct 681 ms 14352 KB Output is correct
24 Correct 417 ms 13320 KB Output is correct
25 Correct 532 ms 19496 KB Output is correct
26 Correct 257 ms 20724 KB Output is correct
27 Correct 697 ms 25356 KB Output is correct
28 Correct 2674 ms 48792 KB Output is correct
29 Correct 2217 ms 48748 KB Output is correct
30 Correct 653 ms 25100 KB Output is correct
31 Correct 604 ms 25204 KB Output is correct
32 Correct 779 ms 25116 KB Output is correct
33 Correct 1201 ms 25416 KB Output is correct
34 Correct 2490 ms 38360 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 8 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 9 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5196 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 6 ms 5120 KB Output is correct
21 Correct 9 ms 5248 KB Output is correct
22 Correct 10 ms 5248 KB Output is correct
23 Correct 9 ms 5248 KB Output is correct
24 Correct 9 ms 5248 KB Output is correct
25 Correct 10 ms 5248 KB Output is correct
26 Correct 10 ms 5220 KB Output is correct
27 Correct 9 ms 5120 KB Output is correct
28 Correct 9 ms 5248 KB Output is correct
29 Correct 9 ms 5248 KB Output is correct
30 Correct 13 ms 5248 KB Output is correct
31 Correct 10 ms 5248 KB Output is correct
32 Correct 13 ms 5248 KB Output is correct
33 Correct 11 ms 5312 KB Output is correct
34 Correct 13 ms 5248 KB Output is correct
35 Correct 12 ms 5248 KB Output is correct
36 Correct 1 ms 5248 KB Output is correct
37 Correct 9 ms 5248 KB Output is correct
38 Correct 10 ms 5248 KB Output is correct
39 Correct 489 ms 14200 KB Output is correct
40 Correct 501 ms 14200 KB Output is correct
41 Correct 508 ms 14196 KB Output is correct
42 Correct 477 ms 14168 KB Output is correct
43 Correct 681 ms 14352 KB Output is correct
44 Correct 417 ms 13320 KB Output is correct
45 Correct 532 ms 19496 KB Output is correct
46 Correct 257 ms 20724 KB Output is correct
47 Correct 697 ms 25356 KB Output is correct
48 Correct 2674 ms 48792 KB Output is correct
49 Correct 2217 ms 48748 KB Output is correct
50 Correct 653 ms 25100 KB Output is correct
51 Correct 604 ms 25204 KB Output is correct
52 Correct 779 ms 25116 KB Output is correct
53 Correct 1201 ms 25416 KB Output is correct
54 Correct 2490 ms 38360 KB Output is correct
55 Correct 58 ms 6660 KB Output is correct
56 Correct 31 ms 6144 KB Output is correct
57 Correct 278 ms 15784 KB Output is correct
58 Correct 75 ms 14820 KB Output is correct
59 Correct 1117 ms 29560 KB Output is correct
60 Execution timed out 3020 ms 58032 KB Time limit exceeded
61 Halted 0 ms 0 KB -