Submission #108214

# Submission time Handle Problem Language Result Execution time Memory
108214 2019-04-28T08:20:07 Z tictaccat Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
142 ms 11256 KB
#include "railroad.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll INF = 1e18;

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {

    int n = (int) s.size();

    vector<vector<ll>> dp((1 << n), vector<ll>(n+1, INF));

    for (int j = 0; j < n; j++) dp[(1<<j)][j] = 0;

    ll low = INF;

    for (int i = 2; i <= n; i++) {
        for (int bits = 0; bits < (1 << n); bits++) {
            if (__builtin_popcount(bits) != i) continue;
            for (int j = 0; j < n; j++) {
                if (!(bits & (1<<j))) continue;
                for (int k = 0; k < n; k++) {
                    if (k == j || !(bits&(1<<k))) continue;
                    dp[bits][j] = min(dp[bits][j], dp[bits^(1<<j)][k] + max(0,t[k]-s[j]));
                }
                if (i == n) low = min(low,dp[bits][j]);
            }
        }
    }

    return low;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 3 ms 384 KB n = 2
4 Correct 2 ms 256 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 384 KB n = 2
7 Correct 2 ms 364 KB n = 3
8 Correct 2 ms 384 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 3 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 3 ms 384 KB n = 8
15 Correct 3 ms 384 KB n = 8
16 Correct 3 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 3 ms 384 KB n = 8
19 Correct 3 ms 256 KB n = 3
20 Correct 3 ms 384 KB n = 7
21 Correct 3 ms 384 KB n = 8
22 Correct 5 ms 384 KB n = 8
23 Correct 3 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 3 ms 384 KB n = 2
4 Correct 2 ms 256 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 384 KB n = 2
7 Correct 2 ms 364 KB n = 3
8 Correct 2 ms 384 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 3 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 3 ms 384 KB n = 8
15 Correct 3 ms 384 KB n = 8
16 Correct 3 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 3 ms 384 KB n = 8
19 Correct 3 ms 256 KB n = 3
20 Correct 3 ms 384 KB n = 7
21 Correct 3 ms 384 KB n = 8
22 Correct 5 ms 384 KB n = 8
23 Correct 3 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 10 ms 384 KB n = 8
27 Correct 3 ms 384 KB n = 8
28 Correct 2 ms 384 KB n = 8
29 Correct 84 ms 11136 KB n = 16
30 Correct 75 ms 11256 KB n = 16
31 Correct 64 ms 11136 KB n = 16
32 Correct 65 ms 11136 KB n = 16
33 Correct 69 ms 11136 KB n = 16
34 Correct 80 ms 11136 KB n = 16
35 Correct 80 ms 11136 KB n = 16
36 Correct 39 ms 5796 KB n = 15
37 Correct 3 ms 384 KB n = 8
38 Correct 142 ms 11256 KB n = 16
39 Correct 82 ms 11136 KB n = 16
40 Correct 3 ms 384 KB n = 9
41 Correct 67 ms 11136 KB n = 16
42 Correct 83 ms 11136 KB n = 16
43 Correct 72 ms 11136 KB n = 16
44 Correct 3 ms 384 KB n = 9
45 Correct 50 ms 5760 KB n = 15
46 Correct 81 ms 11256 KB n = 16
47 Correct 77 ms 11136 KB n = 16
48 Correct 100 ms 11136 KB n = 16
# Verdict Execution time Memory Grader output
1 Runtime error 81 ms 10008 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 3 ms 384 KB n = 2
4 Correct 2 ms 256 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 384 KB n = 2
7 Correct 2 ms 364 KB n = 3
8 Correct 2 ms 384 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 3 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 3 ms 384 KB n = 8
15 Correct 3 ms 384 KB n = 8
16 Correct 3 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 3 ms 384 KB n = 8
19 Correct 3 ms 256 KB n = 3
20 Correct 3 ms 384 KB n = 7
21 Correct 3 ms 384 KB n = 8
22 Correct 5 ms 384 KB n = 8
23 Correct 3 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 10 ms 384 KB n = 8
27 Correct 3 ms 384 KB n = 8
28 Correct 2 ms 384 KB n = 8
29 Correct 84 ms 11136 KB n = 16
30 Correct 75 ms 11256 KB n = 16
31 Correct 64 ms 11136 KB n = 16
32 Correct 65 ms 11136 KB n = 16
33 Correct 69 ms 11136 KB n = 16
34 Correct 80 ms 11136 KB n = 16
35 Correct 80 ms 11136 KB n = 16
36 Correct 39 ms 5796 KB n = 15
37 Correct 3 ms 384 KB n = 8
38 Correct 142 ms 11256 KB n = 16
39 Correct 82 ms 11136 KB n = 16
40 Correct 3 ms 384 KB n = 9
41 Correct 67 ms 11136 KB n = 16
42 Correct 83 ms 11136 KB n = 16
43 Correct 72 ms 11136 KB n = 16
44 Correct 3 ms 384 KB n = 9
45 Correct 50 ms 5760 KB n = 15
46 Correct 81 ms 11256 KB n = 16
47 Correct 77 ms 11136 KB n = 16
48 Correct 100 ms 11136 KB n = 16
49 Runtime error 81 ms 10008 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -