oj.uz

Submission #635347

# Submission time Handle Problem Language Result Execution time Memory
635347 2022-08-26T06:29:36 Z shafinalam Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
 52 ms 13128 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
//#define int ll
 
#include "railroad.h"
 
ll dp[70005][25];
 
ll plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = s.size();
    for(int i=0;i<(1<<n);i++){
    	for(int j=0;j<n;j++){
    		dp[i][j] = 2e18;
		}
	}
	for(int i=1;i<(1<<n);i++){
		int cnt=0;
		for(int j=0;j<n;j++){
			if(i&(1<<j)){
				cnt++;
			}
		}
		if(cnt==1){
			for(int j=0;j<n;j++){
				if(i&(1<<j)){
					dp[i][j] = 0;
				}
			}
			continue;
		}
		for(int j=0;j<n;j++){
			if(i&(1<<j)){
				int p = i-(1<<j);
				for(int k=0;k<n;k++){
					if(p&(1<<k)){
						dp[i][j] = min(dp[i][j],dp[p][k]+max(0,t[k]-s[j]));
					}
				}
			}
		}
	}
	ll ans=2e18;
	for(int i=0;i<n;i++){
		ans = min(ans,dp[(1<<n)-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 1 ms 304 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 308 KB n = 3
10 Correct 1 ms 340 KB n = 8
11 Correct 1 ms 304 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 0 ms 340 KB n = 8
14 Correct 0 ms 340 KB n = 8
15 Correct 1 ms 304 KB n = 8
16 Correct 0 ms 340 KB n = 8
17 Correct 1 ms 456 KB n = 8
18 Correct 0 ms 308 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 0 ms 312 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 340 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 1 ms 304 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 308 KB n = 3
10 Correct 1 ms 340 KB n = 8
11 Correct 1 ms 304 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 0 ms 340 KB n = 8
14 Correct 0 ms 340 KB n = 8
15 Correct 1 ms 304 KB n = 8
16 Correct 0 ms 340 KB n = 8
17 Correct 1 ms 456 KB n = 8
18 Correct 0 ms 308 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 0 ms 312 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 340 KB n = 8
26 Correct 0 ms 340 KB n = 8
27 Correct 1 ms 340 KB n = 8
28 Correct 1 ms 340 KB n = 8
29 Correct 40 ms 13012 KB n = 16
30 Correct 46 ms 13012 KB n = 16
31 Correct 39 ms 13012 KB n = 16
32 Correct 39 ms 13108 KB n = 16
33 Correct 40 ms 13012 KB n = 16
34 Correct 37 ms 13104 KB n = 16
35 Correct 40 ms 13012 KB n = 16
36 Correct 20 ms 6612 KB n = 15
37 Correct 1 ms 340 KB n = 8
38 Correct 48 ms 13128 KB n = 16
39 Correct 40 ms 13012 KB n = 16
40 Correct 1 ms 308 KB n = 9
41 Correct 39 ms 13112 KB n = 16
42 Correct 38 ms 13012 KB n = 16
43 Correct 39 ms 13124 KB n = 16
44 Correct 1 ms 340 KB n = 9
45 Correct 20 ms 6704 KB n = 15
46 Correct 41 ms 13108 KB n = 16
47 Correct 40 ms 13048 KB n = 16
48 Correct 38 ms 13012 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 52 ms 10568 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 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 1 ms 304 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 308 KB n = 3
10 Correct 1 ms 340 KB n = 8
11 Correct 1 ms 304 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 0 ms 340 KB n = 8
14 Correct 0 ms 340 KB n = 8
15 Correct 1 ms 304 KB n = 8
16 Correct 0 ms 340 KB n = 8
17 Correct 1 ms 456 KB n = 8
18 Correct 0 ms 308 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 0 ms 312 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 340 KB n = 8
26 Correct 0 ms 340 KB n = 8
27 Correct 1 ms 340 KB n = 8
28 Correct 1 ms 340 KB n = 8
29 Correct 40 ms 13012 KB n = 16
30 Correct 46 ms 13012 KB n = 16
31 Correct 39 ms 13012 KB n = 16
32 Correct 39 ms 13108 KB n = 16
33 Correct 40 ms 13012 KB n = 16
34 Correct 37 ms 13104 KB n = 16
35 Correct 40 ms 13012 KB n = 16
36 Correct 20 ms 6612 KB n = 15
37 Correct 1 ms 340 KB n = 8
38 Correct 48 ms 13128 KB n = 16
39 Correct 40 ms 13012 KB n = 16
40 Correct 1 ms 308 KB n = 9
41 Correct 39 ms 13112 KB n = 16
42 Correct 38 ms 13012 KB n = 16
43 Correct 39 ms 13124 KB n = 16
44 Correct 1 ms 340 KB n = 9
45 Correct 20 ms 6704 KB n = 15
46 Correct 41 ms 13108 KB n = 16
47 Correct 40 ms 13048 KB n = 16
48 Correct 38 ms 13012 KB n = 16
49 Runtime error 52 ms 10568 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -