oj.uz

Submission #165441

# Submission time Handle Problem Language Result Execution time Memory
165441 2019-11-27T09:29:59 Z Segtree Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
 140 ms 8696 KB 
#include<iostream>
#include<algorithm>
#include<vector>
#include"railroad.h"
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b);
ll dp[(1<<16)][16];
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]=1e17;
    for(int j=0;j<n;j++){
	dp[(1<<j)][j]=0;
    }
    for(int i=1;i<(1<<n);i++)for(int j=0;j<n;j++){
	for(int k=0;k<n;k++){
	    if((i&(1<<k))==0)chmin(dp[i+(1<<k)][k],dp[i][j]+max(0LL,(ll)t[j]-s[k]));
	}
    }
    ll ans=1e17;
    for(int j=0;j<n;j++)chmin(ans,dp[(1<<n)-1][j]);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 252 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 504 KB n = 3
8 Correct 2 ms 376 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 376 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 380 KB n = 8
23 Correct 2 ms 380 KB n = 8
24 Correct 2 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 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 252 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 504 KB n = 3
8 Correct 2 ms 376 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 376 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 380 KB n = 8
23 Correct 2 ms 380 KB n = 8
24 Correct 2 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 140 ms 8568 KB n = 16
30 Correct 54 ms 8568 KB n = 16
31 Correct 53 ms 8572 KB n = 16
32 Correct 55 ms 8604 KB n = 16
33 Correct 55 ms 8568 KB n = 16
34 Correct 55 ms 8572 KB n = 16
35 Correct 54 ms 8568 KB n = 16
36 Correct 27 ms 4472 KB n = 15
37 Correct 2 ms 376 KB n = 8
38 Correct 54 ms 8572 KB n = 16
39 Correct 59 ms 8580 KB n = 16
40 Correct 2 ms 380 KB n = 9
41 Correct 54 ms 8568 KB n = 16
42 Correct 55 ms 8568 KB n = 16
43 Correct 55 ms 8568 KB n = 16
44 Correct 2 ms 376 KB n = 9
45 Correct 26 ms 4472 KB n = 15
46 Correct 54 ms 8568 KB n = 16
47 Correct 56 ms 8600 KB n = 16
48 Correct 55 ms 8696 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 80 ms 8388 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 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 252 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 504 KB n = 3
8 Correct 2 ms 376 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 376 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 380 KB n = 8
23 Correct 2 ms 380 KB n = 8
24 Correct 2 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 140 ms 8568 KB n = 16
30 Correct 54 ms 8568 KB n = 16
31 Correct 53 ms 8572 KB n = 16
32 Correct 55 ms 8604 KB n = 16
33 Correct 55 ms 8568 KB n = 16
34 Correct 55 ms 8572 KB n = 16
35 Correct 54 ms 8568 KB n = 16
36 Correct 27 ms 4472 KB n = 15
37 Correct 2 ms 376 KB n = 8
38 Correct 54 ms 8572 KB n = 16
39 Correct 59 ms 8580 KB n = 16
40 Correct 2 ms 380 KB n = 9
41 Correct 54 ms 8568 KB n = 16
42 Correct 55 ms 8568 KB n = 16
43 Correct 55 ms 8568 KB n = 16
44 Correct 2 ms 376 KB n = 9
45 Correct 26 ms 4472 KB n = 15
46 Correct 54 ms 8568 KB n = 16
47 Correct 56 ms 8600 KB n = 16
48 Correct 55 ms 8696 KB n = 16
49 Runtime error 80 ms 8388 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -