oj.uz

Submission #394734

# Submission time Handle Problem Language Result Execution time Memory
394734 2021-04-27T08:42:34 Z kshitij_sodani Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
 61 ms 10564 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'


#include "railroad.h"
llo dp[1<<17][17];
long long plan_roller_coaster(vector<int> ss,vector<int> tt) {
    int n = (int) ss.size();
  /*  for(auto j:ss){
    	cout<<j<<",";
    }
    cout<<endl;
    for(auto j:tt){
    	cout<<j<<",";
    }
    cout<<endl;*/
    for(int i=1;i<(1<<n);i++){
    	for(int j=0;j<n;j++){
    		dp[i][j]=(llo)1e18;
    		if((1<<j)&i){
    			if(i-(1<<j)==0){
    				dp[i][j]=0;
    				continue;
    			}
    			for(int k=0;k<n;k++){
    				if(k!=j){
    					if((1<<k)&i){
    						/*if(i==1+8 and j==3){
    							cout<<k<<","<<tt[k]<<":"<<ss[j]<<endl;
    						}*/
    						dp[i][j]=min(dp[i][j],dp[i-(1<<j)][k]+max(tt[k]-ss[j],0));
    					}
    				}
    			}
    		}
    	}
    }


    llo ans=1e18;
  //  cout<<dp[1+(1<<3)][3]<<endl;
    for(int i=0;i<n;i++){
    	ans=min(ans,dp[(1<<n)-1][i]);
    //	cout<<dp[(1<<n)-1][i]<<":";
    }
   // cout<<endl;













    
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 2
2 Correct 1 ms 332 KB n = 2
3 Correct 1 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 1 ms 204 KB n = 2
6 Correct 1 ms 204 KB n = 2
7 Correct 1 ms 204 KB n = 3
8 Correct 1 ms 204 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 1 ms 332 KB n = 8
11 Correct 1 ms 332 KB n = 8
12 Correct 1 ms 332 KB n = 8
13 Correct 1 ms 332 KB n = 8
14 Correct 1 ms 308 KB n = 8
15 Correct 1 ms 332 KB n = 8
16 Correct 1 ms 332 KB n = 8
17 Correct 1 ms 332 KB n = 8
18 Correct 1 ms 332 KB n = 8
19 Correct 1 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 1 ms 300 KB n = 8
22 Correct 1 ms 332 KB n = 8
23 Correct 1 ms 332 KB n = 8
24 Correct 1 ms 332 KB n = 8
25 Correct 1 ms 332 KB n = 8
26 Correct 1 ms 304 KB n = 8
27 Correct 1 ms 336 KB n = 8
28 Correct 1 ms 336 KB n = 8
29 Correct 42 ms 8956 KB n = 16
30 Correct 42 ms 8996 KB n = 16
31 Correct 41 ms 9040 KB n = 16
32 Correct 44 ms 8932 KB n = 16
33 Correct 41 ms 8900 KB n = 16
34 Correct 41 ms 9004 KB n = 16
35 Correct 42 ms 8900 KB n = 16
36 Correct 19 ms 4652 KB n = 15
37 Correct 1 ms 332 KB n = 8
38 Correct 41 ms 9016 KB n = 16
39 Correct 43 ms 9024 KB n = 16
40 Correct 1 ms 332 KB n = 9
41 Correct 42 ms 8928 KB n = 16
42 Correct 49 ms 8964 KB n = 16
43 Correct 41 ms 8968 KB n = 16
44 Correct 1 ms 332 KB n = 9
45 Correct 19 ms 4652 KB n = 15
46 Correct 41 ms 9104 KB n = 16
47 Correct 43 ms 9052 KB n = 16
48 Correct 42 ms 8976 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 61 ms 10564 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 1 ms 204 KB n = 2
2 Correct 1 ms 332 KB n = 2
3 Correct 1 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 1 ms 204 KB n = 2
6 Correct 1 ms 204 KB n = 2
7 Correct 1 ms 204 KB n = 3
8 Correct 1 ms 204 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 1 ms 332 KB n = 8
11 Correct 1 ms 332 KB n = 8
12 Correct 1 ms 332 KB n = 8
13 Correct 1 ms 332 KB n = 8
14 Correct 1 ms 308 KB n = 8
15 Correct 1 ms 332 KB n = 8
16 Correct 1 ms 332 KB n = 8
17 Correct 1 ms 332 KB n = 8
18 Correct 1 ms 332 KB n = 8
19 Correct 1 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 1 ms 300 KB n = 8
22 Correct 1 ms 332 KB n = 8
23 Correct 1 ms 332 KB n = 8
24 Correct 1 ms 332 KB n = 8
25 Correct 1 ms 332 KB n = 8
26 Correct 1 ms 304 KB n = 8
27 Correct 1 ms 336 KB n = 8
28 Correct 1 ms 336 KB n = 8
29 Correct 42 ms 8956 KB n = 16
30 Correct 42 ms 8996 KB n = 16
31 Correct 41 ms 9040 KB n = 16
32 Correct 44 ms 8932 KB n = 16
33 Correct 41 ms 8900 KB n = 16
34 Correct 41 ms 9004 KB n = 16
35 Correct 42 ms 8900 KB n = 16
36 Correct 19 ms 4652 KB n = 15
37 Correct 1 ms 332 KB n = 8
38 Correct 41 ms 9016 KB n = 16
39 Correct 43 ms 9024 KB n = 16
40 Correct 1 ms 332 KB n = 9
41 Correct 42 ms 8928 KB n = 16
42 Correct 49 ms 8964 KB n = 16
43 Correct 41 ms 8968 KB n = 16
44 Correct 1 ms 332 KB n = 9
45 Correct 19 ms 4652 KB n = 15
46 Correct 41 ms 9104 KB n = 16
47 Correct 43 ms 9052 KB n = 16
48 Correct 42 ms 8976 KB n = 16
49 Runtime error 61 ms 10564 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -