Submission #44345

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
44345	2018-03-31T13:25:20 Z	shash42	Race (IOI11_race)	C++11	21 / 100	260 ms	15604 KB

race

#include<iostream>
#include<vector>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
using namespace std;
vector< pii > adj[100005];
bool rem[100005];
int K, sub[100005], par[100005], nxt;
int arr[1000005], best=1e9, ans=1e9, inf=1e9;
vector< pii > q;
void dfs1(int u)
{
	sub[u]=1;
	for(pii v: adj[u])
	{
		if(v.first!=par[u] && !rem[v.first])
		{
			par[v.first]=u;
			dfs1(v.first);
			sub[u]+=sub[v.first];
		}
	}
}
void dfs2(int u, int cand)
{
	int currsz=sub[cand]-sub[u];
	for(pii v: adj[u])
	{
		if(v.first!=par[u] && !rem[v.first])
		{
			currsz=max(currsz, sub[v.first]);
			dfs2(v.first, cand);
		}
	}
	if(currsz<best)
	{
		nxt=u;
		best=currsz;
	}
}
void dfs3(int u, int w, int l)
{
	if(w>K) return;
	q.pb(mp(w, l));
	for(pii v: adj[u])
	{
		if(v.first!=par[u] && !rem[v.first])
		{
			par[v.first]=u;
			dfs3(v.first, w+v.second, l+1);	
		}
	}
}
void solve(int cent)
{
	vector<int> tnow;
	tnow.pb(0);
	arr[0]=0;
	for(pii v: adj[cent])
	{
		if(!rem[v.first])
		{
			par[v.first]=cent;
			dfs3(v.first, v.second, 1);
		}
		for(int i = 0; i < q.size(); i++)
		{
			int w=q[i].first, l=q[i].second;
			if(w<=K)
				ans=min(ans, arr[K-w]+l);
		}
		for(int i = 0; i < q.size(); i++)
		{
			arr[q[i].first]=min(arr[q[i].first], q[i].second);
			tnow.pb(q[i].first);
		}
		q.clear();
	}
	for(int i = 0; i < tnow.size(); i++)
		arr[tnow[i]]=inf;
	tnow.clear();
}
void cent(int cand)
{
	nxt=0;
	best=inf;
	par[cand]=cand;
	dfs1(cand);
	dfs2(cand, cand);
	solve(nxt);
	rem[nxt]=true;
	for(pii v: adj[nxt])
		if(!rem[v.first])
			cent(v.first);
}
int best_path(int n, int k, int h[][2], int l[])
{
	K=k;
	for(int i = 1; i <= n; i++)
	{
		adj[i].clear();
		rem[i]=false;
	}
	for(int i = 0; i <= k; i++)
		arr[i]=inf;
	for(int i = 0; i < n-1; i++)
	{
		adj[h[i][0]].pb(mp(h[i][1], l[i]));
		adj[h[i][1]].pb(mp(h[i][0], l[i]));
	}
	cent(1);
	if(ans==inf) ans=-1;
	return ans;
}
/*int main()
{
	int arr[][2]={{0, 1}, {1, 2}};
	int lnt[]={1, 1};
	cout << best_path(11, 12, arr, lnt);
}*/

Compilation message

race.cpp: In function 'void solve(int)':
race.cpp:67:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < q.size(); i++)
                  ~~^~~~~~~~~~
race.cpp:73:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < q.size(); i++)
                  ~~^~~~~~~~~~
race.cpp:80:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < tnow.size(); i++)
                 ~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	3 ms	2824 KB	Output is correct
4	Correct	3 ms	2824 KB	Output is correct
5	Correct	3 ms	2824 KB	Output is correct
6	Correct	4 ms	2824 KB	Output is correct
7	Correct	5 ms	2916 KB	Output is correct
8	Correct	4 ms	2916 KB	Output is correct
9	Correct	4 ms	2916 KB	Output is correct
10	Correct	3 ms	2916 KB	Output is correct
11	Correct	4 ms	2992 KB	Output is correct
12	Correct	5 ms	2992 KB	Output is correct
13	Correct	5 ms	2992 KB	Output is correct
14	Correct	4 ms	2992 KB	Output is correct
15	Correct	4 ms	2992 KB	Output is correct
16	Correct	4 ms	2992 KB	Output is correct
17	Correct	5 ms	2992 KB	Output is correct
18	Correct	4 ms	2992 KB	Output is correct
19	Correct	4 ms	2992 KB	Output is correct
20	Correct	6 ms	2992 KB	Output is correct
21	Correct	4 ms	3044 KB	Output is correct
22	Correct	7 ms	6632 KB	Output is correct
23	Correct	7 ms	6632 KB	Output is correct
24	Correct	7 ms	6632 KB	Output is correct
25	Correct	9 ms	6632 KB	Output is correct
26	Correct	6 ms	6632 KB	Output is correct
27	Correct	7 ms	6632 KB	Output is correct
28	Correct	5 ms	6632 KB	Output is correct
29	Correct	7 ms	6632 KB	Output is correct
30	Correct	6 ms	6632 KB	Output is correct
31	Correct	7 ms	6632 KB	Output is correct
32	Correct	6 ms	6632 KB	Output is correct
33	Correct	7 ms	6632 KB	Output is correct
34	Correct	7 ms	6632 KB	Output is correct
35	Correct	7 ms	6632 KB	Output is correct
36	Correct	7 ms	6636 KB	Output is correct
37	Correct	8 ms	6636 KB	Output is correct
38	Correct	7 ms	6636 KB	Output is correct

Subtask #3
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	3 ms	2824 KB	Output is correct
4	Correct	3 ms	2824 KB	Output is correct
5	Correct	3 ms	2824 KB	Output is correct
6	Correct	4 ms	2824 KB	Output is correct
7	Correct	5 ms	2916 KB	Output is correct
8	Correct	4 ms	2916 KB	Output is correct
9	Correct	4 ms	2916 KB	Output is correct
10	Correct	3 ms	2916 KB	Output is correct
11	Correct	4 ms	2992 KB	Output is correct
12	Correct	5 ms	2992 KB	Output is correct
13	Correct	5 ms	2992 KB	Output is correct
14	Correct	4 ms	2992 KB	Output is correct
15	Correct	4 ms	2992 KB	Output is correct
16	Correct	4 ms	2992 KB	Output is correct
17	Correct	5 ms	2992 KB	Output is correct
18	Correct	4 ms	2992 KB	Output is correct
19	Correct	208 ms	8828 KB	Output is correct
20	Correct	174 ms	8828 KB	Output is correct
21	Correct	260 ms	9240 KB	Output is correct
22	Correct	187 ms	9720 KB	Output is correct
23	Correct	141 ms	9720 KB	Output is correct
24	Correct	92 ms	9720 KB	Output is correct
25	Correct	217 ms	14064 KB	Output is correct
26	Correct	139 ms	15604 KB	Output is correct
27	Runtime error	98 ms	15604 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
28	Halted	0 ms	0 KB	-

Subtask #4
0 / 57.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	3 ms	2824 KB	Output is correct
4	Correct	3 ms	2824 KB	Output is correct
5	Correct	3 ms	2824 KB	Output is correct
6	Correct	4 ms	2824 KB	Output is correct
7	Correct	5 ms	2916 KB	Output is correct
8	Correct	4 ms	2916 KB	Output is correct
9	Correct	4 ms	2916 KB	Output is correct
10	Correct	3 ms	2916 KB	Output is correct
11	Correct	4 ms	2992 KB	Output is correct
12	Correct	5 ms	2992 KB	Output is correct
13	Correct	5 ms	2992 KB	Output is correct
14	Correct	4 ms	2992 KB	Output is correct
15	Correct	4 ms	2992 KB	Output is correct
16	Correct	4 ms	2992 KB	Output is correct
17	Correct	5 ms	2992 KB	Output is correct
18	Correct	4 ms	2992 KB	Output is correct
19	Correct	4 ms	2992 KB	Output is correct
20	Correct	6 ms	2992 KB	Output is correct
21	Correct	4 ms	3044 KB	Output is correct
22	Correct	7 ms	6632 KB	Output is correct
23	Correct	7 ms	6632 KB	Output is correct
24	Correct	7 ms	6632 KB	Output is correct
25	Correct	9 ms	6632 KB	Output is correct
26	Correct	6 ms	6632 KB	Output is correct
27	Correct	7 ms	6632 KB	Output is correct
28	Correct	5 ms	6632 KB	Output is correct
29	Correct	7 ms	6632 KB	Output is correct
30	Correct	6 ms	6632 KB	Output is correct
31	Correct	7 ms	6632 KB	Output is correct
32	Correct	6 ms	6632 KB	Output is correct
33	Correct	7 ms	6632 KB	Output is correct
34	Correct	7 ms	6632 KB	Output is correct
35	Correct	7 ms	6632 KB	Output is correct
36	Correct	7 ms	6636 KB	Output is correct
37	Correct	8 ms	6636 KB	Output is correct
38	Correct	7 ms	6636 KB	Output is correct
39	Correct	208 ms	8828 KB	Output is correct
40	Correct	174 ms	8828 KB	Output is correct
41	Correct	260 ms	9240 KB	Output is correct
42	Correct	187 ms	9720 KB	Output is correct
43	Correct	141 ms	9720 KB	Output is correct
44	Correct	92 ms	9720 KB	Output is correct
45	Correct	217 ms	14064 KB	Output is correct
46	Correct	139 ms	15604 KB	Output is correct
47	Runtime error	98 ms	15604 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
48	Halted	0 ms	0 KB	-

Submission #44345

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 22.0

Subtask #4 0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 22.0

Subtask #4
0 / 57.0