oj.uz

Submission #765816

# Submission time Handle Problem Language Result Execution time Memory
765816 2023-06-25T05:50:12 Z SanguineChameleon Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 36 ms 10680 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

const long long inf = 1e18L + 20;
long long dp[1 << 16][16];

long long plan_roller_coaster(vector<int> s, vector<int> t) {
	int n = s.size();
	for (int mask = 0; mask < (1 << n); mask++) {
		for (int i = 0; i < n; i++) {
			dp[mask][i] = inf;
		}
	}
	for (int i = 0; i < n; i++) {
		dp[1 << i][i] = 0;
	}
	for (int mask = 1; mask < (1 << n); mask++) {
		for (int i = 0; i < n; i++) {
			if (dp[mask][i] == inf) {
				continue;
			}
			for (int j = 0; j < n; j++) {
				if (((mask >> j) & 1) == 0) {
					dp[mask | (1 << j)][j] = min(dp[mask | (1 << j)][j], dp[mask][i] + max(t[i] - s[j], 0));
				}
			}
		}
	}
	long long res = inf;
	for (int i = 0; i < n; i++) {
		res = min(res, dp[(1 << n) - 1][i]);
	}
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 316 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 300 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 316 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 1 ms 340 KB n = 8
14 Correct 1 ms 340 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 1 ms 340 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 212 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 316 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 300 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 316 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 1 ms 340 KB n = 8
14 Correct 1 ms 340 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 1 ms 340 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 1 ms 308 KB n = 8
27 Correct 1 ms 340 KB n = 8
28 Correct 1 ms 308 KB n = 8
29 Correct 31 ms 8500 KB n = 16
30 Correct 32 ms 8432 KB n = 16
31 Correct 31 ms 8504 KB n = 16
32 Correct 31 ms 8404 KB n = 16
33 Correct 32 ms 8484 KB n = 16
34 Correct 36 ms 8404 KB n = 16
35 Correct 31 ms 8404 KB n = 16
36 Correct 15 ms 4412 KB n = 15
37 Correct 1 ms 304 KB n = 8
38 Correct 31 ms 8404 KB n = 16
39 Correct 31 ms 8504 KB n = 16
40 Correct 1 ms 308 KB n = 9
41 Correct 31 ms 8404 KB n = 16
42 Correct 31 ms 8496 KB n = 16
43 Correct 31 ms 8404 KB n = 16
44 Correct 1 ms 304 KB n = 9
45 Correct 14 ms 4308 KB n = 15
46 Correct 31 ms 8404 KB n = 16
47 Correct 32 ms 8488 KB n = 16
48 Correct 31 ms 8404 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 35 ms 10680 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 316 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 300 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 316 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 1 ms 340 KB n = 8
14 Correct 1 ms 340 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 1 ms 340 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 1 ms 308 KB n = 8
27 Correct 1 ms 340 KB n = 8
28 Correct 1 ms 308 KB n = 8
29 Correct 31 ms 8500 KB n = 16
30 Correct 32 ms 8432 KB n = 16
31 Correct 31 ms 8504 KB n = 16
32 Correct 31 ms 8404 KB n = 16
33 Correct 32 ms 8484 KB n = 16
34 Correct 36 ms 8404 KB n = 16
35 Correct 31 ms 8404 KB n = 16
36 Correct 15 ms 4412 KB n = 15
37 Correct 1 ms 304 KB n = 8
38 Correct 31 ms 8404 KB n = 16
39 Correct 31 ms 8504 KB n = 16
40 Correct 1 ms 308 KB n = 9
41 Correct 31 ms 8404 KB n = 16
42 Correct 31 ms 8496 KB n = 16
43 Correct 31 ms 8404 KB n = 16
44 Correct 1 ms 304 KB n = 9
45 Correct 14 ms 4308 KB n = 15
46 Correct 31 ms 8404 KB n = 16
47 Correct 32 ms 8488 KB n = 16
48 Correct 31 ms 8404 KB n = 16
49 Runtime error 35 ms 10680 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -