oj.uz

Submission #982450

# Submission time Handle Problem Language Result Execution time Memory
982450 2024-05-14T09:17:25 Z MarwenElarbi Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 273 ms 524288 KB 
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ll long long
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int)s.size();
    long long dp[(1<<n)][n];
    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 mask = 1; mask < (1<<n); ++mask)
    {
        for (int i = 0; i < n; ++i)
        {
            if((1<<i)&mask){
                int submask=mask-(1<<i);
                for (int j = 0; j < n; ++j)
                {
                    if((1<<j)&submask){
                        dp[mask][i]=min(dp[mask][i],dp[submask][j]+max(0,t[j]-s[i]));
                    }
                }
            }
        }
    }
    long long ans=1e18;
    for (int i = 0; i < n; ++i)
    {
        ans=min(ans,dp[(1<<n)-1][i]);
    }
    return ans;
}
/*int main(){
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int n;
    assert(1 == scanf("%d", &n));
    std::vector<int> s(n), t(n);
    for (int i = 0; i < n; ++i)
        assert(2 == scanf("%d%d", &s[i], &t[i]));
    long long ans = plan_roller_coaster(s, t);
    printf("%lld\n", ans);
    return 0;
}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 344 KB n = 2
4 Correct 0 ms 348 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 1 ms 348 KB n = 3
10 Correct 0 ms 348 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 0 ms 344 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 0 ms 348 KB n = 8
17 Correct 0 ms 348 KB n = 8
18 Correct 0 ms 348 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 0 ms 344 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 344 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 1 ms 348 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 344 KB n = 2
4 Correct 0 ms 348 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 1 ms 348 KB n = 3
10 Correct 0 ms 348 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 0 ms 344 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 0 ms 348 KB n = 8
17 Correct 0 ms 348 KB n = 8
18 Correct 0 ms 348 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 0 ms 344 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 344 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 1 ms 348 KB n = 8
26 Correct 0 ms 344 KB n = 8
27 Correct 0 ms 348 KB n = 8
28 Correct 0 ms 348 KB n = 8
29 Correct 35 ms 8540 KB n = 16
30 Correct 35 ms 8536 KB n = 16
31 Correct 39 ms 8540 KB n = 16
32 Correct 38 ms 8536 KB n = 16
33 Correct 35 ms 8540 KB n = 16
34 Correct 35 ms 8540 KB n = 16
35 Correct 34 ms 8540 KB n = 16
36 Correct 16 ms 4184 KB n = 15
37 Correct 1 ms 444 KB n = 8
38 Correct 34 ms 8540 KB n = 16
39 Correct 34 ms 8540 KB n = 16
40 Correct 1 ms 344 KB n = 9
41 Correct 39 ms 8540 KB n = 16
42 Correct 34 ms 8536 KB n = 16
43 Correct 38 ms 8540 KB n = 16
44 Correct 1 ms 348 KB n = 9
45 Correct 16 ms 4188 KB n = 15
46 Correct 34 ms 8636 KB n = 16
47 Correct 35 ms 8540 KB n = 16
48 Correct 35 ms 8636 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 273 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 344 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 344 KB n = 2
4 Correct 0 ms 348 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 1 ms 348 KB n = 3
10 Correct 0 ms 348 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 0 ms 344 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 0 ms 348 KB n = 8
17 Correct 0 ms 348 KB n = 8
18 Correct 0 ms 348 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 0 ms 344 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 344 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 1 ms 348 KB n = 8
26 Correct 0 ms 344 KB n = 8
27 Correct 0 ms 348 KB n = 8
28 Correct 0 ms 348 KB n = 8
29 Correct 35 ms 8540 KB n = 16
30 Correct 35 ms 8536 KB n = 16
31 Correct 39 ms 8540 KB n = 16
32 Correct 38 ms 8536 KB n = 16
33 Correct 35 ms 8540 KB n = 16
34 Correct 35 ms 8540 KB n = 16
35 Correct 34 ms 8540 KB n = 16
36 Correct 16 ms 4184 KB n = 15
37 Correct 1 ms 444 KB n = 8
38 Correct 34 ms 8540 KB n = 16
39 Correct 34 ms 8540 KB n = 16
40 Correct 1 ms 344 KB n = 9
41 Correct 39 ms 8540 KB n = 16
42 Correct 34 ms 8536 KB n = 16
43 Correct 38 ms 8540 KB n = 16
44 Correct 1 ms 348 KB n = 9
45 Correct 16 ms 4188 KB n = 15
46 Correct 34 ms 8636 KB n = 16
47 Correct 35 ms 8540 KB n = 16
48 Correct 35 ms 8636 KB n = 16
49 Runtime error 273 ms 524288 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -