oj.uz

Submission #121181

# Submission time Handle Problem Language Result Execution time Memory
121181 2019-06-26T07:38:51 Z Plurm Roller Coaster Railroad (IOI16_railroad) C++11
34 / 100
 67 ms 8668 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 256 KB n = 2
4 Correct 2 ms 256 KB n = 2
5 Correct 2 ms 384 KB n = 2
6 Correct 2 ms 256 KB n = 2
7 Correct 2 ms 384 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 2 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 2 ms 384 KB n = 8
16 Correct 2 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 2 ms 384 KB n = 8
19 Correct 2 ms 384 KB n = 3
20 Correct 2 ms 384 KB n = 7
21 Correct 2 ms 384 KB n = 8
22 Correct 2 ms 384 KB n = 8
23 Correct 2 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 256 KB n = 2
4 Correct 2 ms 256 KB n = 2
5 Correct 2 ms 384 KB n = 2
6 Correct 2 ms 256 KB n = 2
7 Correct 2 ms 384 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 2 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 2 ms 384 KB n = 8
16 Correct 2 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 2 ms 384 KB n = 8
19 Correct 2 ms 384 KB n = 3
20 Correct 2 ms 384 KB n = 7
21 Correct 2 ms 384 KB n = 8
22 Correct 2 ms 384 KB n = 8
23 Correct 2 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 2 ms 384 KB n = 8
27 Correct 2 ms 384 KB n = 8
28 Correct 2 ms 384 KB n = 8
29 Correct 37 ms 8576 KB n = 16
30 Correct 38 ms 8576 KB n = 16
31 Correct 38 ms 8576 KB n = 16
32 Correct 38 ms 8576 KB n = 16
33 Correct 39 ms 8600 KB n = 16
34 Correct 38 ms 8576 KB n = 16
35 Correct 38 ms 8576 KB n = 16
36 Correct 19 ms 4480 KB n = 15
37 Correct 2 ms 384 KB n = 8
38 Correct 38 ms 8448 KB n = 16
39 Correct 39 ms 8568 KB n = 16
40 Correct 2 ms 384 KB n = 9
41 Correct 54 ms 8668 KB n = 16
42 Correct 39 ms 8576 KB n = 16
43 Correct 38 ms 8576 KB n = 16
44 Correct 2 ms 384 KB n = 9
45 Correct 19 ms 4472 KB n = 15
46 Correct 38 ms 8568 KB n = 16
47 Correct 40 ms 8568 KB n = 16
48 Correct 40 ms 8576 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 67 ms 6776 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 256 KB n = 2
4 Correct 2 ms 256 KB n = 2
5 Correct 2 ms 384 KB n = 2
6 Correct 2 ms 256 KB n = 2
7 Correct 2 ms 384 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 2 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 2 ms 384 KB n = 8
16 Correct 2 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 2 ms 384 KB n = 8
19 Correct 2 ms 384 KB n = 3
20 Correct 2 ms 384 KB n = 7
21 Correct 2 ms 384 KB n = 8
22 Correct 2 ms 384 KB n = 8
23 Correct 2 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 2 ms 384 KB n = 8
27 Correct 2 ms 384 KB n = 8
28 Correct 2 ms 384 KB n = 8
29 Correct 37 ms 8576 KB n = 16
30 Correct 38 ms 8576 KB n = 16
31 Correct 38 ms 8576 KB n = 16
32 Correct 38 ms 8576 KB n = 16
33 Correct 39 ms 8600 KB n = 16
34 Correct 38 ms 8576 KB n = 16
35 Correct 38 ms 8576 KB n = 16
36 Correct 19 ms 4480 KB n = 15
37 Correct 2 ms 384 KB n = 8
38 Correct 38 ms 8448 KB n = 16
39 Correct 39 ms 8568 KB n = 16
40 Correct 2 ms 384 KB n = 9
41 Correct 54 ms 8668 KB n = 16
42 Correct 39 ms 8576 KB n = 16
43 Correct 38 ms 8576 KB n = 16
44 Correct 2 ms 384 KB n = 9
45 Correct 19 ms 4472 KB n = 15
46 Correct 38 ms 8568 KB n = 16
47 Correct 40 ms 8568 KB n = 16
48 Correct 40 ms 8576 KB n = 16
49 Runtime error 67 ms 6776 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -