oj.uz

Submission #617555

# Submission time Handle Problem Language Result Execution time Memory
617555 2022-08-01T12:09:43 Z Dremix10 Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 224 ms 524288 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pp(x) cerr<<#x<<" = ("<<x.F<<" - "<<x.S<<")"<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
    #define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
    #define p(x) {}
    #define p2(x,y) {}
    #define pp(x) {}
    #define pv(x) {}
    #define ppv(x) {}
#endif
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const int N = 3e5+5;
const int MOD = 1e9+7;
const ll INF = 1e18+5;


long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    int m = (1<<n);
    ll dp[m][n];

    int i,j;

    for(i=0;i<m;i++)
        for(j=0;j<n;j++)
            dp[i][j] = INF;

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

    int k;
    for(i=1;i<m;i++){
        for(j=0;j<n;j++){
            if(dp[i][j] == INF)continue;
            for(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(0,t[j] - s[k]));   
            }
        }
    }

    ll ans = INF;
    for(i=0;i<n;i++)
        ans = min(ans,dp[m-1][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 0 ms 212 KB n = 2
3 Correct 0 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 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 0 ms 212 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 0 ms 212 KB n = 2
3 Correct 0 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 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 33 ms 8500 KB n = 16
30 Correct 37 ms 8488 KB n = 16
31 Correct 40 ms 8404 KB n = 16
32 Correct 44 ms 8404 KB n = 16
33 Correct 35 ms 8484 KB n = 16
34 Correct 33 ms 8404 KB n = 16
35 Correct 33 ms 8476 KB n = 16
36 Correct 15 ms 4052 KB n = 15
37 Correct 1 ms 300 KB n = 8
38 Correct 33 ms 8488 KB n = 16
39 Correct 36 ms 8480 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 35 ms 8504 KB n = 16
42 Correct 33 ms 8404 KB n = 16
43 Correct 32 ms 8404 KB n = 16
44 Correct 1 ms 212 KB n = 9
45 Correct 15 ms 4052 KB n = 15
46 Correct 37 ms 8488 KB n = 16
47 Correct 41 ms 8404 KB n = 16
48 Correct 35 ms 8488 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 224 ms 524288 KB Execution killed with signal 9
2 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 0 ms 212 KB n = 2
3 Correct 0 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 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 33 ms 8500 KB n = 16
30 Correct 37 ms 8488 KB n = 16
31 Correct 40 ms 8404 KB n = 16
32 Correct 44 ms 8404 KB n = 16
33 Correct 35 ms 8484 KB n = 16
34 Correct 33 ms 8404 KB n = 16
35 Correct 33 ms 8476 KB n = 16
36 Correct 15 ms 4052 KB n = 15
37 Correct 1 ms 300 KB n = 8
38 Correct 33 ms 8488 KB n = 16
39 Correct 36 ms 8480 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 35 ms 8504 KB n = 16
42 Correct 33 ms 8404 KB n = 16
43 Correct 32 ms 8404 KB n = 16
44 Correct 1 ms 212 KB n = 9
45 Correct 15 ms 4052 KB n = 15
46 Correct 37 ms 8488 KB n = 16
47 Correct 41 ms 8404 KB n = 16
48 Correct 35 ms 8488 KB n = 16
49 Runtime error 224 ms 524288 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -