oj.uz

Submission #944912

# Submission time Handle Problem Language Result Execution time Memory
944912 2024-03-13T07:57:32 Z PenguinsAreCute Stations (IOI20_stations) C++17
76 / 100
 611 ms 1652 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1005
vector<int> a[MAXN];
int pre[MAXN], post[MAXN], h[MAXN];
int c;
void dfs(int x, int p) {
	if(h[x]&1) pre[x] = c++;
	for(auto i: a[x]) if(i != p) {h[i] = h[x] + 1; dfs(i, x);}
	if(!(h[x]&1)) pre[x] = (c++);
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	c = 0; h[0] = 0;
	for(int i = 0; i < MAXN; i++) a[i].clear();
	std::vector<int> labels(n);
	for(int i = 0; i < n - 1; i++) {
		a[u[i]].push_back(v[i]);
		a[v[i]].push_back(u[i]);
	}
	dfs(0, -1);
	for (int i = 0; i < n; i++) labels[i]=pre[i]<<1|(h[i]&1);
	return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
	if(s & 1) {
		if(t < s) return end(c)[-1];
		auto it = lower_bound(c.begin(),c.end(),t&(-2));
		if(it == c.end()) return end(c)[-1];
		return (*it);
	} else {
		if(t > s) return c[0];
		auto it = upper_bound(c.begin(),c.end(),t|1);
		if(it == c.begin()) return c[0];
		return (*(--it));
	}
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 1112 KB Output is correct
2 Correct 290 ms 928 KB Output is correct
3 Correct 548 ms 684 KB Output is correct
4 Correct 452 ms 684 KB Output is correct
5 Correct 360 ms 684 KB Output is correct
6 Correct 290 ms 928 KB Output is correct
7 Correct 272 ms 684 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 381 ms 684 KB Output is correct
12 Correct 291 ms 1036 KB Output is correct
13 Correct 351 ms 1528 KB Output is correct
14 Correct 255 ms 684 KB Output is correct
15 Correct 40 ms 892 KB Output is correct
16 Correct 38 ms 880 KB Output is correct
17 Correct 61 ms 936 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 605 ms 940 KB Output is correct
2 Correct 430 ms 684 KB Output is correct
3 Correct 358 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 0 ms 768 KB Output is correct
7 Correct 413 ms 684 KB Output is correct
8 Correct 611 ms 684 KB Output is correct
9 Correct 449 ms 696 KB Output is correct
10 Correct 361 ms 688 KB Output is correct
11 Correct 4 ms 764 KB Output is correct
12 Correct 4 ms 764 KB Output is correct
13 Correct 3 ms 804 KB Output is correct
14 Correct 2 ms 1024 KB Output is correct
15 Correct 0 ms 768 KB Output is correct
16 Correct 337 ms 684 KB Output is correct
17 Correct 378 ms 936 KB Output is correct
18 Correct 280 ms 684 KB Output is correct
19 Correct 309 ms 684 KB Output is correct
20 Correct 307 ms 684 KB Output is correct

Subtask #5
50.0 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 341 ms 1004 KB Partially correct
2 Partially correct 296 ms 924 KB Partially correct
3 Correct 578 ms 684 KB Output is correct
4 Correct 426 ms 684 KB Output is correct
5 Correct 381 ms 684 KB Output is correct
6 Partially correct 304 ms 932 KB Partially correct
7 Partially correct 305 ms 684 KB Partially correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 0 ms 760 KB Output is correct
11 Partially correct 284 ms 876 KB Partially correct
12 Partially correct 359 ms 848 KB Partially correct
13 Correct 514 ms 684 KB Output is correct
14 Correct 391 ms 684 KB Output is correct
15 Correct 385 ms 684 KB Output is correct
16 Partially correct 269 ms 684 KB Partially correct
17 Correct 337 ms 684 KB Output is correct
18 Partially correct 272 ms 1036 KB Partially correct
19 Partially correct 295 ms 1040 KB Partially correct
20 Partially correct 277 ms 800 KB Partially correct
21 Correct 30 ms 864 KB Output is correct
22 Partially correct 38 ms 968 KB Partially correct
23 Partially correct 61 ms 1172 KB Partially correct
24 Correct 3 ms 760 KB Output is correct
25 Correct 4 ms 768 KB Output is correct
26 Correct 3 ms 768 KB Output is correct
27 Correct 2 ms 764 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 308 ms 684 KB Output is correct
30 Correct 311 ms 684 KB Output is correct
31 Correct 308 ms 684 KB Output is correct
32 Correct 304 ms 684 KB Output is correct
33 Correct 305 ms 684 KB Output is correct
34 Partially correct 197 ms 920 KB Partially correct
35 Partially correct 262 ms 1316 KB Partially correct
36 Partially correct 300 ms 1040 KB Partially correct
37 Partially correct 292 ms 1164 KB Partially correct
38 Partially correct 291 ms 1028 KB Partially correct
39 Partially correct 251 ms 1028 KB Partially correct
40 Partially correct 315 ms 1176 KB Partially correct
41 Partially correct 256 ms 1152 KB Partially correct
42 Partially correct 38 ms 1200 KB Partially correct
43 Partially correct 61 ms 912 KB Partially correct
44 Partially correct 82 ms 1104 KB Partially correct
45 Partially correct 119 ms 896 KB Partially correct
46 Partially correct 208 ms 876 KB Partially correct
47 Partially correct 187 ms 900 KB Partially correct
48 Partially correct 40 ms 1176 KB Partially correct
49 Partially correct 34 ms 1652 KB Partially correct