oj.uz

Submission #635353

# Submission time Handle Problem Language Result Execution time Memory
635353 2022-08-26T06:34:11 Z Bruteforceman Roller Coaster Railroad (IOI16_railroad) C++17
64 / 100
 456 ms 65672 KB 
    #include <bits/stdc++.h>
     
    long long sub12(int n, std::vector <int> s, std::vector <int> t) {
    	t.push_back(1);
    	long long dp[1 << 16][17];
    	for (int mask = 0; mask < (1 << 16); mask++) {
    		for (int i = 0; i < 17; i++) {
    			dp[mask][i] = 1LL << 60;
    		}
    	}
    	for (int i = 0; i < 17; i++) {
    		dp[(1 << n) - 1][i] = 0;
    	}
    	auto f = [&] (auto&& self, int mask, int last) -> long long {
    		if (dp[mask][last] < (1LL << 60)) {
    			return dp[mask][last];
    		}
    		for (int i = 0; i < n; i++) {
    			if (mask & (1 << i)) {
    				continue;
    			}
    			dp[mask][last] = std::min(dp[mask][last], self(self, mask | (1 << i), i) + std::max(0, t[last] - s[i]));
    		}
    		return dp[mask][last];
    	};
    	return f(f, 0, n);
    }
     
    long long plan_roller_coaster(std::vector <int> s, std::vector <int> t) {
    	int n = s.size();
    	if (n <= 16) {
    		return sub12(n, s, t);
    	}
    	std::vector <int> ep { 0, (int) 1e9 };
    	for (int i = 0; i < n; i++) {
    		ep.push_back(s[i]);
    		ep.push_back(t[i]);
    	}
    	std::sort(ep.begin(), ep.end());
    	{
    		std::vector <int> tmp;
    		for (int x : ep) {
    			if (tmp.empty() || x != tmp.back()) {
    				tmp.push_back(x);
    			}
    		}
    		ep = tmp;
    	}
    	std::vector <std::vector <int>> g(ep.size()), h(ep.size());
    	std::vector <int> din(ep.size(), 0), dou(ep.size(), 0);
    	g[(int) ep.size() - 1].push_back(0);
    	h[0].push_back((int) ep.size() - 1);
    	din[0]++;
    	dou[(int) ep.size() - 1]++;
    	for (int i = 0; i < n; i++) {
    		int u = std::lower_bound(ep.begin(), ep.end(), s[i]) - ep.begin();
    		int v = std::lower_bound(ep.begin(), ep.end(), t[i]) - ep.begin();
    		g[u].push_back(v);
    		h[v].push_back(u);
    		din[v]++;
    		dou[u]++;
    	}
    	for (int i = 0; i < (int) ep.size() - 1; i++) {
    		if (din[i] < dou[i]) {
    			return 1;
    		}
    		if (din[i] > dou[i]) {
    			g[i].push_back(i + 1);
    			h[i + 1].push_back(i);
    			din[i + 1] += din[i] - dou[i];
    			dou[i] += din[i] - dou[i];
    		}
    	}
    	auto dfs = [&] (auto&& self, int node, const std::vector <std::vector <int>>& gg, std::vector <bool>& vis) -> int {
    		int r = 1;
    		vis[node] = true;
    		for (int x : gg[node]) {
    			if (!vis[x]) {
    				r += self(self, x, gg, vis);
    			}
    		}
    		return r;
    	};
    	std::vector <bool> vis1(ep.size(), false);
    	std::vector <bool> vis2(ep.size(), false);
    	if (dfs(dfs, 0, g, vis1) < (int) ep.size() || dfs(dfs, 0, h, vis2) < (int) ep.size()) {
    		return 1;
    	}
    	return 0;
    }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB n = 2
2 Correct 6 ms 8916 KB n = 2
3 Correct 5 ms 8916 KB n = 2
4 Correct 6 ms 9044 KB n = 2
5 Correct 5 ms 8916 KB n = 2
6 Correct 5 ms 8892 KB n = 2
7 Correct 4 ms 8916 KB n = 3
8 Correct 4 ms 8916 KB n = 3
9 Correct 5 ms 8916 KB n = 3
10 Correct 4 ms 8916 KB n = 8
11 Correct 5 ms 8932 KB n = 8
12 Correct 6 ms 8916 KB n = 8
13 Correct 4 ms 8916 KB n = 8
14 Correct 4 ms 8916 KB n = 8
15 Correct 4 ms 8916 KB n = 8
16 Correct 7 ms 9020 KB n = 8
17 Correct 5 ms 9016 KB n = 8
18 Correct 5 ms 8916 KB n = 8
19 Correct 5 ms 8916 KB n = 3
20 Correct 5 ms 8916 KB n = 7
21 Correct 5 ms 8916 KB n = 8
22 Correct 4 ms 8988 KB n = 8
23 Correct 4 ms 8932 KB n = 8
24 Correct 5 ms 8912 KB n = 8
25 Correct 5 ms 8932 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB n = 2
2 Correct 6 ms 8916 KB n = 2
3 Correct 5 ms 8916 KB n = 2
4 Correct 6 ms 9044 KB n = 2
5 Correct 5 ms 8916 KB n = 2
6 Correct 5 ms 8892 KB n = 2
7 Correct 4 ms 8916 KB n = 3
8 Correct 4 ms 8916 KB n = 3
9 Correct 5 ms 8916 KB n = 3
10 Correct 4 ms 8916 KB n = 8
11 Correct 5 ms 8932 KB n = 8
12 Correct 6 ms 8916 KB n = 8
13 Correct 4 ms 8916 KB n = 8
14 Correct 4 ms 8916 KB n = 8
15 Correct 4 ms 8916 KB n = 8
16 Correct 7 ms 9020 KB n = 8
17 Correct 5 ms 9016 KB n = 8
18 Correct 5 ms 8916 KB n = 8
19 Correct 5 ms 8916 KB n = 3
20 Correct 5 ms 8916 KB n = 7
21 Correct 5 ms 8916 KB n = 8
22 Correct 4 ms 8988 KB n = 8
23 Correct 4 ms 8932 KB n = 8
24 Correct 5 ms 8912 KB n = 8
25 Correct 5 ms 8932 KB n = 8
26 Correct 5 ms 8996 KB n = 8
27 Correct 5 ms 8916 KB n = 8
28 Correct 4 ms 8916 KB n = 8
29 Correct 57 ms 8916 KB n = 16
30 Correct 59 ms 9008 KB n = 16
31 Correct 64 ms 8916 KB n = 16
32 Correct 68 ms 8916 KB n = 16
33 Correct 57 ms 8916 KB n = 16
34 Correct 57 ms 8916 KB n = 16
35 Correct 58 ms 8996 KB n = 16
36 Correct 27 ms 9012 KB n = 15
37 Correct 5 ms 8916 KB n = 8
38 Correct 64 ms 8916 KB n = 16
39 Correct 61 ms 8916 KB n = 16
40 Correct 5 ms 8916 KB n = 9
41 Correct 62 ms 9000 KB n = 16
42 Correct 66 ms 8916 KB n = 16
43 Correct 62 ms 9000 KB n = 16
44 Correct 5 ms 8916 KB n = 9
45 Correct 25 ms 8916 KB n = 15
46 Correct 56 ms 9012 KB n = 16
47 Correct 56 ms 8992 KB n = 16
48 Correct 71 ms 8996 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 61772 KB n = 199999
2 Correct 274 ms 43324 KB n = 199991
3 Correct 265 ms 43280 KB n = 199993
4 Correct 311 ms 45200 KB n = 152076
5 Correct 176 ms 28136 KB n = 93249
6 Correct 400 ms 48776 KB n = 199910
7 Correct 367 ms 58804 KB n = 199999
8 Correct 343 ms 50384 KB n = 199997
9 Correct 398 ms 51316 KB n = 171294
10 Correct 290 ms 42152 KB n = 140872
11 Correct 354 ms 49340 KB n = 199886
12 Correct 347 ms 59040 KB n = 199996
13 Correct 351 ms 52512 KB n = 200000
14 Correct 251 ms 42044 KB n = 199998
15 Correct 252 ms 41400 KB n = 200000
16 Correct 279 ms 42680 KB n = 199998
17 Correct 253 ms 43400 KB n = 200000
18 Correct 252 ms 41332 KB n = 190000
19 Correct 325 ms 58400 KB n = 177777
20 Correct 187 ms 30100 KB n = 100000
21 Correct 456 ms 60052 KB n = 200000
22 Correct 302 ms 55852 KB n = 200000
23 Correct 445 ms 65672 KB n = 200000

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB n = 2
2 Correct 6 ms 8916 KB n = 2
3 Correct 5 ms 8916 KB n = 2
4 Correct 6 ms 9044 KB n = 2
5 Correct 5 ms 8916 KB n = 2
6 Correct 5 ms 8892 KB n = 2
7 Correct 4 ms 8916 KB n = 3
8 Correct 4 ms 8916 KB n = 3
9 Correct 5 ms 8916 KB n = 3
10 Correct 4 ms 8916 KB n = 8
11 Correct 5 ms 8932 KB n = 8
12 Correct 6 ms 8916 KB n = 8
13 Correct 4 ms 8916 KB n = 8
14 Correct 4 ms 8916 KB n = 8
15 Correct 4 ms 8916 KB n = 8
16 Correct 7 ms 9020 KB n = 8
17 Correct 5 ms 9016 KB n = 8
18 Correct 5 ms 8916 KB n = 8
19 Correct 5 ms 8916 KB n = 3
20 Correct 5 ms 8916 KB n = 7
21 Correct 5 ms 8916 KB n = 8
22 Correct 4 ms 8988 KB n = 8
23 Correct 4 ms 8932 KB n = 8
24 Correct 5 ms 8912 KB n = 8
25 Correct 5 ms 8932 KB n = 8
26 Correct 5 ms 8996 KB n = 8
27 Correct 5 ms 8916 KB n = 8
28 Correct 4 ms 8916 KB n = 8
29 Correct 57 ms 8916 KB n = 16
30 Correct 59 ms 9008 KB n = 16
31 Correct 64 ms 8916 KB n = 16
32 Correct 68 ms 8916 KB n = 16
33 Correct 57 ms 8916 KB n = 16
34 Correct 57 ms 8916 KB n = 16
35 Correct 58 ms 8996 KB n = 16
36 Correct 27 ms 9012 KB n = 15
37 Correct 5 ms 8916 KB n = 8
38 Correct 64 ms 8916 KB n = 16
39 Correct 61 ms 8916 KB n = 16
40 Correct 5 ms 8916 KB n = 9
41 Correct 62 ms 9000 KB n = 16
42 Correct 66 ms 8916 KB n = 16
43 Correct 62 ms 9000 KB n = 16
44 Correct 5 ms 8916 KB n = 9
45 Correct 25 ms 8916 KB n = 15
46 Correct 56 ms 9012 KB n = 16
47 Correct 56 ms 8992 KB n = 16
48 Correct 71 ms 8996 KB n = 16
49 Correct 413 ms 61772 KB n = 199999
50 Correct 274 ms 43324 KB n = 199991
51 Correct 265 ms 43280 KB n = 199993
52 Correct 311 ms 45200 KB n = 152076
53 Correct 176 ms 28136 KB n = 93249
54 Correct 400 ms 48776 KB n = 199910
55 Correct 367 ms 58804 KB n = 199999
56 Correct 343 ms 50384 KB n = 199997
57 Correct 398 ms 51316 KB n = 171294
58 Correct 290 ms 42152 KB n = 140872
59 Correct 354 ms 49340 KB n = 199886
60 Correct 347 ms 59040 KB n = 199996
61 Correct 351 ms 52512 KB n = 200000
62 Correct 251 ms 42044 KB n = 199998
63 Correct 252 ms 41400 KB n = 200000
64 Correct 279 ms 42680 KB n = 199998
65 Correct 253 ms 43400 KB n = 200000
66 Correct 252 ms 41332 KB n = 190000
67 Correct 325 ms 58400 KB n = 177777
68 Correct 187 ms 30100 KB n = 100000
69 Correct 456 ms 60052 KB n = 200000
70 Correct 302 ms 55852 KB n = 200000
71 Correct 445 ms 65672 KB n = 200000
72 Correct 410 ms 65672 KB n = 200000
73 Incorrect 287 ms 43324 KB answer is not correct: 1 instead of 34382661743
74 Halted 0 ms 0 KB -