oj.uz

Submission #836062

# Submission time Handle Problem Language Result Execution time Memory
836062 2023-08-24T06:50:21 Z Alihan_8 Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 52 ms 11092 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define pb push_back
#define ln '\n'
//#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

const i64 inf = 1e16 + 1;

i64 plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = (int)s.size();
    assert(n <= 16);
    const int S = 1 << n;
    vector <vector<i64>> dp(S, vector <i64> (n, inf));
    for ( int i = 0; i < n; i++ ){
        dp[1 << i][i] = 0;
    }
    auto cost = [&](int i, int j){
        return max(0, t[i] - s[j]);
    };
    for ( int mask = 1; mask < S; mask++ ){
        for ( int i = 0; i < n; i++ ){
            if ( mask >> i & 1 ){
                int v = mask ^ (1 << i);
                for ( int j = 0; j < n; j++ ){
                    if ( v >> j & 1 ){
                        chmin(dp[mask][i], dp[v][j] + cost(i, j));
                    }
                }
            }
        }
    }
    i64 ans = inf;
    for ( int i = 0; i < n; i++ ){
        chmin(ans, dp[S - 1][i]);
    }
    return ans;
}

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 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 260 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 1 ms 212 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 1 ms 212 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 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 260 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 1 ms 212 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 1 ms 212 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 1 ms 212 KB n = 8
29 Correct 41 ms 10964 KB n = 16
30 Correct 44 ms 10964 KB n = 16
31 Correct 39 ms 11072 KB n = 16
32 Correct 43 ms 11092 KB n = 16
33 Correct 46 ms 10964 KB n = 16
34 Correct 41 ms 11068 KB n = 16
35 Correct 44 ms 11064 KB n = 16
36 Correct 23 ms 5076 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 44 ms 10964 KB n = 16
39 Correct 45 ms 10964 KB n = 16
40 Correct 1 ms 396 KB n = 9
41 Correct 40 ms 10964 KB n = 16
42 Correct 42 ms 11092 KB n = 16
43 Correct 41 ms 11088 KB n = 16
44 Correct 1 ms 340 KB n = 9
45 Correct 20 ms 5076 KB n = 15
46 Correct 52 ms 11068 KB n = 16
47 Correct 45 ms 11060 KB n = 16
48 Correct 43 ms 10964 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 37 ms 10572 KB Execution killed with signal 6
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 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 260 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 1 ms 212 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 1 ms 212 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 1 ms 212 KB n = 8
29 Correct 41 ms 10964 KB n = 16
30 Correct 44 ms 10964 KB n = 16
31 Correct 39 ms 11072 KB n = 16
32 Correct 43 ms 11092 KB n = 16
33 Correct 46 ms 10964 KB n = 16
34 Correct 41 ms 11068 KB n = 16
35 Correct 44 ms 11064 KB n = 16
36 Correct 23 ms 5076 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 44 ms 10964 KB n = 16
39 Correct 45 ms 10964 KB n = 16
40 Correct 1 ms 396 KB n = 9
41 Correct 40 ms 10964 KB n = 16
42 Correct 42 ms 11092 KB n = 16
43 Correct 41 ms 11088 KB n = 16
44 Correct 1 ms 340 KB n = 9
45 Correct 20 ms 5076 KB n = 15
46 Correct 52 ms 11068 KB n = 16
47 Correct 45 ms 11060 KB n = 16
48 Correct 43 ms 10964 KB n = 16
49 Runtime error 37 ms 10572 KB Execution killed with signal 6
50 Halted 0 ms 0 KB -