oj.uz

Submission #132933

# Submission time Handle Problem Language Result Execution time Memory
132933 2019-07-20T01:46:18 Z wzy Roller Coaster Railroad (IOI16_railroad) C++11
34 / 100
 83 ms 12152 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[1<<17][17];
vector<int> s , t;

long long plan_roller_coaster(std::vector<int> sx, std::vector<int> tx){
    int n = (int) sx.size();
    s = sx , t = tx;
    for(int i = 0 ; i < (1<<n) ; i ++){
    	for(int j = 0 ; j < n; j ++){
    		dp[i][j] = (ll) 1e18;
    	}
    }
    for(int i = 0 ; i < n;i ++){
    	dp[1<<i][i] = 0;
    }
    for(int i = 0 ; i < (1<<n) ; i ++){
    	for(int j = 0 ; j < n ; j ++){
    		if((1<<j) & i){
    			for(int k = 0 ; k < n ; k++){
    				if((1<<k) & (i^(1<<j))){
    					if(dp[i][j] > (dp[i^(1<<j)][k] + (ll)max(t[k] - s[j] , 0))){
    						dp[i][j] = min(dp[i][j] , dp[i^(1<<j)][k] + (ll)max(t[k] - s[j] , 0));
    					}    					
    				}
    			}
    		}
    	}
    }
    int L = (1<<n);
    L--;
    ll p = (ll) 1e18;
    for(int j = 0 ; j < n ; j ++){
    	p = min(p , dp[L][j]);
    }
    return p;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 256 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 376 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 504 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 376 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 376 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 376 KB n = 3
20 Correct 2 ms 376 KB n = 7
21 Correct 2 ms 376 KB n = 8
22 Correct 2 ms 376 KB n = 8
23 Correct 2 ms 376 KB n = 8
24 Correct 3 ms 376 KB n = 8
25 Correct 2 ms 376 KB n = 8
26 Correct 2 ms 376 KB n = 8
27 Correct 2 ms 376 KB n = 8
28 Correct 2 ms 376 KB n = 8
29 Correct 51 ms 9132 KB n = 16
30 Correct 59 ms 9084 KB n = 16
31 Correct 49 ms 9080 KB n = 16
32 Correct 46 ms 9080 KB n = 16
33 Correct 45 ms 9080 KB n = 16
34 Correct 52 ms 9080 KB n = 16
35 Correct 58 ms 9208 KB n = 16
36 Correct 29 ms 4728 KB n = 15
37 Correct 2 ms 376 KB n = 8
38 Correct 62 ms 9080 KB n = 16
39 Correct 61 ms 9080 KB n = 16
40 Correct 2 ms 380 KB n = 9
41 Correct 46 ms 9080 KB n = 16
42 Correct 56 ms 9080 KB n = 16
43 Correct 46 ms 9080 KB n = 16
44 Correct 2 ms 376 KB n = 9
45 Correct 28 ms 4768 KB n = 15
46 Correct 59 ms 9080 KB n = 16
47 Correct 61 ms 9080 KB n = 16
48 Correct 62 ms 9080 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 83 ms 12152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 256 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 376 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 504 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 376 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 376 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 376 KB n = 3
20 Correct 2 ms 376 KB n = 7
21 Correct 2 ms 376 KB n = 8
22 Correct 2 ms 376 KB n = 8
23 Correct 2 ms 376 KB n = 8
24 Correct 3 ms 376 KB n = 8
25 Correct 2 ms 376 KB n = 8
26 Correct 2 ms 376 KB n = 8
27 Correct 2 ms 376 KB n = 8
28 Correct 2 ms 376 KB n = 8
29 Correct 51 ms 9132 KB n = 16
30 Correct 59 ms 9084 KB n = 16
31 Correct 49 ms 9080 KB n = 16
32 Correct 46 ms 9080 KB n = 16
33 Correct 45 ms 9080 KB n = 16
34 Correct 52 ms 9080 KB n = 16
35 Correct 58 ms 9208 KB n = 16
36 Correct 29 ms 4728 KB n = 15
37 Correct 2 ms 376 KB n = 8
38 Correct 62 ms 9080 KB n = 16
39 Correct 61 ms 9080 KB n = 16
40 Correct 2 ms 380 KB n = 9
41 Correct 46 ms 9080 KB n = 16
42 Correct 56 ms 9080 KB n = 16
43 Correct 46 ms 9080 KB n = 16
44 Correct 2 ms 376 KB n = 9
45 Correct 28 ms 4768 KB n = 15
46 Correct 59 ms 9080 KB n = 16
47 Correct 61 ms 9080 KB n = 16
48 Correct 62 ms 9080 KB n = 16
49 Runtime error 83 ms 12152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -