oj.uz

Submission #926942

# Submission time Handle Problem Language Result Execution time Memory
926942 2024-02-14T05:31:31 Z vjudge1 Stations (IOI20_stations) C++17
100 / 100
 599 ms 1512 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
 
#define isz(a) (int)(a).size()
 
const int NM = 1000;
 
vector <int> adj[NM+5];
int dep[NM+5];
int timer = 0, tin[NM+5], tout[NM+5];
vector <int> arr;
 
void dfs(int u, int p){
	dep[u] = (p == -1 ? 0 : dep[p]+1);
	tin[u] = ++timer;
	for (int v : adj[u]){
		if (v == p) continue;
		dfs(v, u);
	}
	tout[u] = ++timer;
}
 
vector <int> label(int n, int k, vector <int> u, vector <int> v){
	for (int i = 0; i < n; i++) adj[i].clear();
	for (int i = 0; i < n-1; i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	dfs(0, -1);
	arr.clear();
	for (int i = 0; i < n; i++){
		if (dep[i]&1) arr.push_back(tout[i]); else arr.push_back(tin[i]);
	}
	sort(arr.begin(), arr.end());
	vector <int> ans(n);
	for (int i = 0; i < n; i++){
		if (dep[i]&1) ans[i] = lower_bound(arr.begin(), arr.end(), tout[i])-arr.begin();
		else ans[i] = lower_bound(arr.begin(), arr.end(), tin[i])-arr.begin();
	}
	return ans;
}
 
int find_next_station(int s, int t, vector <int> c){
	if (s < c.front()){
		if (t < s || t > c.back()) return c.back();
		for (int i = 0; i < isz(c); i++)
			if (c[i] >= t) return c[i];
	}
	else{
		if (t < c.front() || t > s) return c.front();
		for (int i = isz(c)-1; i >= 0; i--)
			if (c[i] <= t) return c[i];
	}
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 401 ms 928 KB Output is correct
2 Correct 309 ms 916 KB Output is correct
3 Correct 573 ms 884 KB Output is correct
4 Correct 400 ms 804 KB Output is correct
5 Correct 390 ms 684 KB Output is correct
6 Correct 286 ms 912 KB Output is correct
7 Correct 302 ms 684 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 0 ms 768 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 940 KB Output is correct
2 Correct 355 ms 824 KB Output is correct
3 Correct 578 ms 684 KB Output is correct
4 Correct 421 ms 684 KB Output is correct
5 Correct 379 ms 940 KB Output is correct
6 Correct 306 ms 940 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 920 KB Output is correct
2 Correct 323 ms 920 KB Output is correct
3 Correct 567 ms 684 KB Output is correct
4 Correct 404 ms 680 KB Output is correct
5 Correct 379 ms 684 KB Output is correct
6 Correct 262 ms 904 KB Output is correct
7 Correct 245 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 768 KB Output is correct
11 Correct 349 ms 688 KB Output is correct
12 Correct 294 ms 1276 KB Output is correct
13 Correct 285 ms 1344 KB Output is correct
14 Correct 269 ms 684 KB Output is correct
15 Correct 40 ms 684 KB Output is correct
16 Correct 43 ms 1180 KB Output is correct
17 Correct 60 ms 916 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 940 KB Output is correct
2 Correct 450 ms 684 KB Output is correct
3 Correct 422 ms 800 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 1 ms 772 KB Output is correct
7 Correct 382 ms 684 KB Output is correct
8 Correct 555 ms 684 KB Output is correct
9 Correct 408 ms 684 KB Output is correct
10 Correct 366 ms 800 KB Output is correct
11 Correct 4 ms 768 KB Output is correct
12 Correct 3 ms 768 KB Output is correct
13 Correct 4 ms 768 KB Output is correct
14 Correct 2 ms 808 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 355 ms 684 KB Output is correct
17 Correct 293 ms 988 KB Output is correct
18 Correct 310 ms 684 KB Output is correct
19 Correct 328 ms 684 KB Output is correct
20 Correct 307 ms 684 KB Output is correct

Subtask #5
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 355 ms 916 KB Output is correct
2 Correct 316 ms 908 KB Output is correct
3 Correct 599 ms 684 KB Output is correct
4 Correct 438 ms 684 KB Output is correct
5 Correct 354 ms 684 KB Output is correct
6 Correct 284 ms 916 KB Output is correct
7 Correct 293 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 Correct 247 ms 888 KB Output is correct
12 Correct 322 ms 852 KB Output is correct
13 Correct 589 ms 688 KB Output is correct
14 Correct 473 ms 684 KB Output is correct
15 Correct 399 ms 684 KB Output is correct
16 Correct 283 ms 684 KB Output is correct
17 Correct 362 ms 684 KB Output is correct
18 Correct 302 ms 1148 KB Output is correct
19 Correct 287 ms 1028 KB Output is correct
20 Correct 322 ms 684 KB Output is correct
21 Correct 35 ms 684 KB Output is correct
22 Correct 36 ms 944 KB Output is correct
23 Correct 60 ms 948 KB Output is correct
24 Correct 3 ms 764 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 764 KB Output is correct
29 Correct 336 ms 684 KB Output is correct
30 Correct 276 ms 684 KB Output is correct
31 Correct 273 ms 684 KB Output is correct
32 Correct 276 ms 684 KB Output is correct
33 Correct 302 ms 684 KB Output is correct
34 Correct 178 ms 912 KB Output is correct
35 Correct 252 ms 1400 KB Output is correct
36 Correct 268 ms 1176 KB Output is correct
37 Correct 244 ms 1156 KB Output is correct
38 Correct 251 ms 1152 KB Output is correct
39 Correct 271 ms 1160 KB Output is correct
40 Correct 287 ms 1228 KB Output is correct
41 Correct 256 ms 1288 KB Output is correct
42 Correct 36 ms 956 KB Output is correct
43 Correct 64 ms 912 KB Output is correct
44 Correct 86 ms 948 KB Output is correct
45 Correct 92 ms 932 KB Output is correct
46 Correct 201 ms 868 KB Output is correct
47 Correct 188 ms 888 KB Output is correct
48 Correct 36 ms 1512 KB Output is correct
49 Correct 33 ms 964 KB Output is correct