oj.uz

Submission #959067

# Submission time Handle Problem Language Result Execution time Memory
959067 2024-04-07T12:53:14 Z The_Samurai Stations (IOI20_stations) C++17
73.3618 / 100
 575 ms 1504 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 {
		tin[u] = z++;
		vis[u] = true;
		for (int v: adj[u]) {
			if (vis[v]) continue;
			h[v] = h[u] + 1;
			dfs(dfs, v);
		}
		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 556 KB Invalid labels (values out of range). scenario=2, k=1000, vertex=1, label=3981
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 1316 KB Output is correct
2 Correct 294 ms 940 KB Output is correct
3 Correct 575 ms 688 KB Output is correct
4 Correct 443 ms 684 KB Output is correct
5 Correct 402 ms 684 KB Output is correct
6 Correct 301 ms 900 KB Output is correct
7 Correct 288 ms 684 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 1272 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 379 ms 684 KB Output is correct
12 Correct 326 ms 1232 KB Output is correct
13 Correct 307 ms 976 KB Output is correct
14 Correct 311 ms 684 KB Output is correct
15 Correct 36 ms 768 KB Output is correct
16 Correct 41 ms 872 KB Output is correct
17 Correct 55 ms 920 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 557 ms 684 KB Output is correct
2 Correct 486 ms 688 KB Output is correct
3 Correct 382 ms 684 KB Output is correct
4 Correct 1 ms 764 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 423 ms 684 KB Output is correct
8 Correct 552 ms 684 KB Output is correct
9 Correct 421 ms 684 KB Output is correct
10 Correct 406 ms 684 KB Output is correct
11 Correct 4 ms 764 KB Output is correct
12 Correct 3 ms 764 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 1 ms 764 KB Output is correct
16 Correct 345 ms 684 KB Output is correct
17 Correct 317 ms 684 KB Output is correct
18 Correct 334 ms 684 KB Output is correct
19 Correct 339 ms 684 KB Output is correct
20 Correct 352 ms 684 KB Output is correct

Subtask #5
47.3618 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 341 ms 900 KB Partially correct
2 Partially correct 296 ms 900 KB Partially correct
3 Correct 536 ms 864 KB Output is correct
4 Correct 421 ms 684 KB Output is correct
5 Correct 390 ms 684 KB Output is correct
6 Partially correct 336 ms 904 KB Partially correct
7 Partially correct 269 ms 684 KB Partially correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 3 ms 932 KB Output is correct
10 Correct 0 ms 768 KB Output is correct
11 Partially correct 321 ms 1116 KB Partially correct
12 Partially correct 339 ms 836 KB Partially correct
13 Correct 574 ms 688 KB Output is correct
14 Correct 415 ms 684 KB Output is correct
15 Correct 377 ms 684 KB Output is correct
16 Partially correct 292 ms 684 KB Partially correct
17 Correct 378 ms 684 KB Output is correct
18 Partially correct 319 ms 976 KB Partially correct
19 Partially correct 301 ms 1232 KB Partially correct
20 Partially correct 263 ms 684 KB Partially correct
21 Correct 36 ms 944 KB Output is correct
22 Partially correct 42 ms 1168 KB Partially correct
23 Partially correct 62 ms 960 KB Partially correct
24 Correct 4 ms 768 KB Output is correct
25 Correct 4 ms 932 KB Output is correct
26 Correct 3 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 326 ms 684 KB Output is correct
30 Correct 311 ms 684 KB Output is correct
31 Correct 341 ms 684 KB Output is correct
32 Correct 325 ms 684 KB Output is correct
33 Correct 313 ms 684 KB Output is correct
34 Partially correct 210 ms 892 KB Partially correct
35 Partially correct 274 ms 1504 KB Partially correct
36 Partially correct 293 ms 968 KB Partially correct
37 Partially correct 269 ms 1136 KB Partially correct
38 Partially correct 301 ms 1212 KB Partially correct
39 Partially correct 287 ms 1228 KB Partially correct
40 Partially correct 307 ms 1216 KB Partially correct
41 Partially correct 296 ms 960 KB Partially correct
42 Partially correct 36 ms 840 KB Partially correct
43 Partially correct 67 ms 872 KB Partially correct
44 Partially correct 88 ms 952 KB Partially correct
45 Partially correct 93 ms 904 KB Partially correct
46 Partially correct 175 ms 840 KB Partially correct
47 Partially correct 216 ms 880 KB Partially correct
48 Partially correct 38 ms 964 KB Partially correct
49 Partially correct 32 ms 1488 KB Partially correct