Submission #955080

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
955080	2024-03-29T10:46:33 Z	Trisanu_Das	Stations (IOI20_stations)	C++17	69.868 / 100	623 ms	1672 KB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> vals;
int t = 0;
void dfs(vector<vector<int>> &adj, int node, int p, int f)
{
	if(f)vals[node] = t++;
	for (auto a : adj[node])
	{
		if (a != p)
			dfs(adj, a, node, !f);
	}
	if(!f)vals[node] = t++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
	vector<vector<int>> adj(n + 1);
	for (int i = 0; i < n - 1; i++)
	{
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	vals.resize(n, 0);
	dfs(adj, 0, -1, 1);
	return vals;
}
 
int find_next_station(int s, int t, vector<int> c)
{
	
	if (c.back() < s) reverse(c.begin(), c.end());
	for (int x: c) if (min(s, x) <= t && t <= max(s, x)) return x;
	return c.back();
}

Subtask #1

0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	832 KB	Invalid labels (values out of range). scenario=2, k=1000, vertex=1, label=1008
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	3 ms	692 KB	Invalid labels (values out of range). scenario=1, k=1000, vertex=1, label=1507
2	Halted	0 ms	0 KB	-

Subtask #3

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	326 ms	948 KB	Output is correct
2	Correct	289 ms	932 KB	Output is correct
3	Correct	592 ms	684 KB	Output is correct
4	Correct	370 ms	944 KB	Output is correct
5	Correct	349 ms	684 KB	Output is correct
6	Correct	305 ms	940 KB	Output is correct
7	Correct	313 ms	684 KB	Output is correct
8	Correct	2 ms	768 KB	Output is correct
9	Correct	2 ms	768 KB	Output is correct
10	Correct	0 ms	764 KB	Output is correct
11	Correct	399 ms	940 KB	Output is correct
12	Correct	295 ms	1016 KB	Output is correct
13	Correct	293 ms	1268 KB	Output is correct
14	Correct	270 ms	684 KB	Output is correct
15	Correct	37 ms	768 KB	Output is correct
16	Correct	35 ms	904 KB	Output is correct
17	Correct	62 ms	860 KB	Output is correct

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	623 ms	684 KB	Output is correct
2	Correct	401 ms	684 KB	Output is correct
3	Correct	426 ms	684 KB	Output is correct
4	Correct	1 ms	764 KB	Output is correct
5	Correct	2 ms	768 KB	Output is correct
6	Correct	0 ms	768 KB	Output is correct
7	Correct	426 ms	688 KB	Output is correct
8	Correct	556 ms	840 KB	Output is correct
9	Correct	428 ms	684 KB	Output is correct
10	Correct	406 ms	684 KB	Output is correct
11	Correct	3 ms	764 KB	Output is correct
12	Correct	4 ms	764 KB	Output is correct
13	Correct	3 ms	772 KB	Output is correct
14	Correct	3 ms	768 KB	Output is correct
15	Correct	1 ms	764 KB	Output is correct
16	Correct	291 ms	684 KB	Output is correct
17	Correct	300 ms	684 KB	Output is correct
18	Correct	292 ms	876 KB	Output is correct
19	Correct	297 ms	940 KB	Output is correct
20	Correct	281 ms	684 KB	Output is correct

Subtask #5

43.868 / 61.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	349 ms	940 KB	Partially correct
2	Partially correct	255 ms	1416 KB	Partially correct
3	Correct	542 ms	684 KB	Output is correct
4	Correct	409 ms	684 KB	Output is correct
5	Correct	358 ms	684 KB	Output is correct
6	Partially correct	267 ms	932 KB	Partially correct
7	Correct	303 ms	684 KB	Output is correct
8	Correct	1 ms	768 KB	Output is correct
9	Correct	3 ms	764 KB	Output is correct
10	Correct	0 ms	768 KB	Output is correct
11	Partially correct	295 ms	860 KB	Partially correct
12	Partially correct	374 ms	828 KB	Partially correct
13	Correct	601 ms	684 KB	Output is correct
14	Correct	397 ms	684 KB	Output is correct
15	Correct	342 ms	684 KB	Output is correct
16	Correct	252 ms	684 KB	Output is correct
17	Correct	353 ms	684 KB	Output is correct
18	Partially correct	250 ms	1168 KB	Partially correct
19	Partially correct	328 ms	1604 KB	Partially correct
20	Correct	308 ms	684 KB	Output is correct
21	Correct	30 ms	764 KB	Output is correct
22	Partially correct	41 ms	904 KB	Partially correct
23	Partially correct	61 ms	892 KB	Partially correct
24	Correct	3 ms	764 KB	Output is correct
25	Correct	4 ms	764 KB	Output is correct
26	Correct	2 ms	768 KB	Output is correct
27	Correct	2 ms	768 KB	Output is correct
28	Correct	0 ms	764 KB	Output is correct
29	Correct	336 ms	684 KB	Output is correct
30	Correct	313 ms	684 KB	Output is correct
31	Correct	334 ms	940 KB	Output is correct
32	Correct	302 ms	684 KB	Output is correct
33	Correct	312 ms	684 KB	Output is correct
34	Partially correct	211 ms	916 KB	Partially correct
35	Partially correct	297 ms	1532 KB	Partially correct
36	Partially correct	264 ms	1000 KB	Partially correct
37	Partially correct	316 ms	1152 KB	Partially correct
38	Partially correct	247 ms	1156 KB	Partially correct
39	Partially correct	328 ms	1400 KB	Partially correct
40	Partially correct	278 ms	1144 KB	Partially correct
41	Partially correct	345 ms	1224 KB	Partially correct
42	Partially correct	37 ms	1148 KB	Partially correct
43	Partially correct	57 ms	944 KB	Partially correct
44	Partially correct	91 ms	864 KB	Partially correct
45	Partially correct	111 ms	924 KB	Partially correct
46	Partially correct	223 ms	884 KB	Partially correct
47	Partially correct	188 ms	888 KB	Partially correct
48	Partially correct	33 ms	1672 KB	Partially correct
49	Partially correct	33 ms	1496 KB	Partially correct