oj.uz

Submission #889176

# Submission time Handle Problem Language Result Execution time Memory
889176 2023-12-19T05:27:42 Z Sir_Ahmed_Imran Roller Coaster Railroad (IOI16_railroad) C++17
11 / 100
 35 ms 6860 KB 
                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long 
ll plan_roller_coaster(vector<int> s,vector<int> t){
    int n=s.size(),m;
    int pwr[16];
    for(int i=pwr[0]=1;i<16;i++)
        pwr[i]=pwr[i-1]*2;
    ll dp[pwr[n]][n];
    for(int i=1;i<pwr[n];i++)
        for(int j=0;j<n;j++)
            dp[i][j]=1e17;
    for(int i=1;i<pwr[n];i++){
        for(int j=0;j<n;j++){
            if((i&pwr[j])==0) continue;
            m=i-pwr[j];
            if(!m) dp[i][j]=0;
            else{
                for(int k=0;k<n;k++)
                    if((m&pwr[k])==pwr[k])
                        dp[i][j]=min(dp[i][j],dp[m][k]+max(0,t[k]-s[j]));
            }
        }
    }
    ll x=1e17;
    for(int i=0;i<n;i++)
        x=min(x,dp[pwr[n]-1][i]);
    return x;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 1 ms 348 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 0 ms 348 KB n = 3
10 Correct 1 ms 348 KB n = 8
11 Correct 0 ms 436 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 0 ms 432 KB n = 8
14 Correct 0 ms 348 KB n = 8
15 Correct 0 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 436 KB n = 7
21 Correct 0 ms 344 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 348 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 0 ms 348 KB n = 8

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 1 ms 348 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 0 ms 348 KB n = 3
10 Correct 1 ms 348 KB n = 8
11 Correct 0 ms 436 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 0 ms 432 KB n = 8
14 Correct 0 ms 348 KB n = 8
15 Correct 0 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 436 KB n = 7
21 Correct 0 ms 344 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 348 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 0 ms 348 KB n = 8
26 Correct 0 ms 348 KB n = 8
27 Correct 0 ms 348 KB n = 8
28 Correct 1 ms 348 KB n = 8
29 Correct 0 ms 344 KB n = 16
30 Correct 0 ms 348 KB n = 16
31 Incorrect 0 ms 348 KB answer is not correct: 953251991 instead of 5295826283
32 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 35 ms 6860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 1 ms 348 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 0 ms 348 KB n = 3
10 Correct 1 ms 348 KB n = 8
11 Correct 0 ms 436 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 0 ms 432 KB n = 8
14 Correct 0 ms 348 KB n = 8
15 Correct 0 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 436 KB n = 7
21 Correct 0 ms 344 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 348 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 0 ms 348 KB n = 8
26 Correct 0 ms 348 KB n = 8
27 Correct 0 ms 348 KB n = 8
28 Correct 1 ms 348 KB n = 8
29 Correct 0 ms 344 KB n = 16
30 Correct 0 ms 348 KB n = 16
31 Incorrect 0 ms 348 KB answer is not correct: 953251991 instead of 5295826283
32 Halted 0 ms 0 KB -