oj.uz

Submission #959071

# Submission time Handle Problem Language Result Execution time Memory
959071 2024-04-07T12:59:22 Z The_Samurai Stations (IOI20_stations) C++17
76 / 100
 608 ms 1664 KB 
#include "stations.h"
#include "bits/stdc++.h"
using namespace std;

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<vector<int>> adj(n);
	vector<bool> vis(n);
	for (int i = 0; i < n - 1; i++) {
		adj[u[i]].emplace_back(v[i]);
		adj[v[i]].emplace_back(u[i]);
	}
	int z = 0;
	vector<int> h(n), tin(n), tout(n), ans(n);
	auto dfs = [&](auto &dfs, int u) -> void {
		if (h[u] % 2 == 0) tin[u] = z++;
		vis[u] = true;
		for (int v: adj[u]) {
			if (vis[v]) continue;
			h[v] = h[u] + 1;
			dfs(dfs, v);
		}
		if (h[u] % 2) tout[u] = z++;
	};
	dfs(dfs, 0);
	for (int i = 0; i < n; i++) ans[i] = h[i] % 2 ? tout[i] * 2 + 1 : tin[i] * 2;
	// for (int i = 0; i < n; i++) cout << ans[i] << ' ';
	// cout << endl;
	return ans;
}


int find_next_station(int s, int t, std::vector<int> c) {
	sort(c.begin(), c.end());
	// cout << '\t' << s << ' ' << t << endl;
	// cout << '\t';
	// for (int u: c) cout << u << ' ';
	// cout << endl;
	if (s % 2 == 0) {
		for (int u: c) {
			if (s <= t and t <= u) return u;
		}
		return c.back();
	} else {
		reverse(c.begin(), c.end());
		for (int u: c) {
			if (u == c.back()) return u;
			if (u <= t and t <= s) return u;
		}
	}
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:50:1: warning: control reaches end of non-void function [-Wreturn-type]
   50 | }
      | ^

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 904 KB Output is correct
2 Correct 282 ms 896 KB Output is correct
3 Correct 608 ms 684 KB Output is correct
4 Correct 500 ms 684 KB Output is correct
5 Correct 368 ms 684 KB Output is correct
6 Correct 310 ms 900 KB Output is correct
7 Correct 268 ms 684 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 1020 KB Output is correct
10 Correct 0 ms 768 KB Output is correct
11 Correct 362 ms 684 KB Output is correct
12 Correct 316 ms 980 KB Output is correct
13 Correct 280 ms 1664 KB Output is correct
14 Correct 306 ms 684 KB Output is correct
15 Correct 33 ms 768 KB Output is correct
16 Correct 36 ms 824 KB Output is correct
17 Correct 68 ms 872 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 608 ms 684 KB Output is correct
2 Correct 412 ms 684 KB Output is correct
3 Correct 333 ms 684 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 0 ms 936 KB Output is correct
7 Correct 380 ms 772 KB Output is correct
8 Correct 549 ms 684 KB Output is correct
9 Correct 433 ms 684 KB Output is correct
10 Correct 370 ms 684 KB Output is correct
11 Correct 4 ms 764 KB Output is correct
12 Correct 4 ms 768 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 3 ms 768 KB Output is correct
15 Correct 2 ms 772 KB Output is correct
16 Correct 379 ms 684 KB Output is correct
17 Correct 341 ms 684 KB Output is correct
18 Correct 330 ms 684 KB Output is correct
19 Correct 292 ms 680 KB Output is correct
20 Correct 304 ms 684 KB Output is correct

Subtask #5
50.0 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 352 ms 908 KB Partially correct
2 Partially correct 291 ms 896 KB Partially correct
3 Correct 600 ms 684 KB Output is correct
4 Correct 406 ms 684 KB Output is correct
5 Correct 387 ms 684 KB Output is correct
6 Partially correct 325 ms 900 KB Partially correct
7 Partially correct 285 ms 684 KB Partially correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 0 ms 764 KB Output is correct
11 Partially correct 299 ms 1064 KB Partially correct
12 Partially correct 348 ms 836 KB Partially correct
13 Correct 511 ms 684 KB Output is correct
14 Correct 406 ms 684 KB Output is correct
15 Correct 417 ms 684 KB Output is correct
16 Partially correct 299 ms 684 KB Partially correct
17 Correct 390 ms 684 KB Output is correct
18 Partially correct 291 ms 980 KB Partially correct
19 Partially correct 296 ms 1228 KB Partially correct
20 Partially correct 289 ms 864 KB Partially correct
21 Correct 31 ms 868 KB Output is correct
22 Partially correct 40 ms 916 KB Partially correct
23 Partially correct 54 ms 872 KB Partially correct
24 Correct 4 ms 768 KB Output is correct
25 Correct 4 ms 768 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 768 KB Output is correct
29 Correct 349 ms 940 KB Output is correct
30 Correct 309 ms 684 KB Output is correct
31 Correct 305 ms 684 KB Output is correct
32 Correct 365 ms 936 KB Output is correct
33 Correct 311 ms 684 KB Output is correct
34 Partially correct 208 ms 896 KB Partially correct
35 Partially correct 295 ms 1156 KB Partially correct
36 Partially correct 302 ms 976 KB Partially correct
37 Partially correct 322 ms 1216 KB Partially correct
38 Partially correct 281 ms 1216 KB Partially correct
39 Partially correct 288 ms 1140 KB Partially correct
40 Partially correct 318 ms 1144 KB Partially correct
41 Partially correct 271 ms 1212 KB Partially correct
42 Partially correct 45 ms 844 KB Partially correct
43 Partially correct 65 ms 1132 KB Partially correct
44 Partially correct 77 ms 864 KB Partially correct
45 Partially correct 104 ms 880 KB Partially correct
46 Partially correct 179 ms 848 KB Partially correct
47 Partially correct 194 ms 884 KB Partially correct
48 Partially correct 32 ms 1384 KB Partially correct
49 Partially correct 35 ms 1256 KB Partially correct