oj.uz

Submission #778302

# Submission time Handle Problem Language Result Execution time Memory
778302 2023-07-10T08:21:10 Z vjudge1 Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 36 ms 9044 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 17
#define ll long long

ll dp[(1<<N)][N];
const ll INF = 2e18 + 7;

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = (int) s.size();
    if (n >= N) return 0;
    for (int i = 0; i < n; i++)
        dp[(1<<n) - 1][i] = 0;

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

    ll ans = INF;
    for (int i = 0; i < n; i++) ans = min(ans, dp[(1<<i)][i]);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 340 KB n = 8
11 Correct 0 ms 340 KB n = 8
12 Correct 1 ms 312 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 0 ms 340 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 0 ms 340 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 356 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 308 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 340 KB n = 8
11 Correct 0 ms 340 KB n = 8
12 Correct 1 ms 312 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 0 ms 340 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 0 ms 340 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 356 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 308 KB n = 8
26 Correct 1 ms 312 KB n = 8
27 Correct 1 ms 312 KB n = 8
28 Correct 1 ms 304 KB n = 8
29 Correct 30 ms 8972 KB n = 16
30 Correct 30 ms 8996 KB n = 16
31 Correct 30 ms 9012 KB n = 16
32 Correct 29 ms 8904 KB n = 16
33 Correct 36 ms 8940 KB n = 16
34 Correct 30 ms 9016 KB n = 16
35 Correct 30 ms 8916 KB n = 16
36 Correct 14 ms 4620 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 29 ms 9012 KB n = 16
39 Correct 31 ms 8908 KB n = 16
40 Correct 1 ms 340 KB n = 9
41 Correct 34 ms 9000 KB n = 16
42 Correct 30 ms 9012 KB n = 16
43 Correct 34 ms 9004 KB n = 16
44 Correct 1 ms 340 KB n = 9
45 Correct 14 ms 4548 KB n = 15
46 Correct 30 ms 9044 KB n = 16
47 Correct 30 ms 8996 KB n = 16
48 Correct 30 ms 9016 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3420 KB n = 199999
2 Incorrect 31 ms 3424 KB answer is not correct: 0 instead of 1
3 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 340 KB n = 8
11 Correct 0 ms 340 KB n = 8
12 Correct 1 ms 312 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 0 ms 340 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 0 ms 340 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 356 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 308 KB n = 8
26 Correct 1 ms 312 KB n = 8
27 Correct 1 ms 312 KB n = 8
28 Correct 1 ms 304 KB n = 8
29 Correct 30 ms 8972 KB n = 16
30 Correct 30 ms 8996 KB n = 16
31 Correct 30 ms 9012 KB n = 16
32 Correct 29 ms 8904 KB n = 16
33 Correct 36 ms 8940 KB n = 16
34 Correct 30 ms 9016 KB n = 16
35 Correct 30 ms 8916 KB n = 16
36 Correct 14 ms 4620 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 29 ms 9012 KB n = 16
39 Correct 31 ms 8908 KB n = 16
40 Correct 1 ms 340 KB n = 9
41 Correct 34 ms 9000 KB n = 16
42 Correct 30 ms 9012 KB n = 16
43 Correct 34 ms 9004 KB n = 16
44 Correct 1 ms 340 KB n = 9
45 Correct 14 ms 4548 KB n = 15
46 Correct 30 ms 9044 KB n = 16
47 Correct 30 ms 8996 KB n = 16
48 Correct 30 ms 9016 KB n = 16
49 Correct 30 ms 3420 KB n = 199999
50 Incorrect 31 ms 3424 KB answer is not correct: 0 instead of 1
51 Halted 0 ms 0 KB -