oj.uz

Submission #940854

# Submission time Handle Problem Language Result Execution time Memory
940854 2024-03-07T18:56:11 Z Lalic Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 35 ms 10572 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5+10;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9+7;

ll dp[16][65540];

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n=(int)s.size();
    
	for(int i=0;i<n;i++)
		for(int j=0;j<(1<<n);j++)
			dp[i][j]=LINF;
	
	dp[0][0]=0;
	for(int i=1;i<(1<<n);i++){
		for(int j=0;j<n;j++){
			if(!(i&(1<<j))) continue;
			int curr=(i^(1<<j));
			if(curr==0) dp[j][i]=0;
			else{
				for(int k=0;k<n;k++){
					if(!(curr&(1<<k))) continue;
					dp[j][i]=min(dp[j][i], dp[k][curr]+max((ll)t[k]-(ll)s[j], 0ll));
				}
			}
		}
	}
	
	ll ans=LINF;
	for(int i=0;i<n;i++) ans=min(ans, dp[i][(1<<n)-1]);
	
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB n = 2
2 Correct 1 ms 2644 KB n = 2
3 Correct 0 ms 2396 KB n = 2
4 Correct 1 ms 2396 KB n = 2
5 Correct 1 ms 2396 KB n = 2
6 Correct 2 ms 2396 KB n = 2
7 Correct 1 ms 2396 KB n = 3
8 Correct 0 ms 2396 KB n = 3
9 Correct 1 ms 2396 KB n = 3
10 Correct 1 ms 4444 KB n = 8
11 Correct 1 ms 4452 KB n = 8
12 Correct 1 ms 4444 KB n = 8
13 Correct 1 ms 4444 KB n = 8
14 Correct 1 ms 4444 KB n = 8
15 Correct 1 ms 4444 KB n = 8
16 Correct 1 ms 4444 KB n = 8
17 Correct 1 ms 4536 KB n = 8
18 Correct 1 ms 4444 KB n = 8
19 Correct 1 ms 2396 KB n = 3
20 Correct 1 ms 4440 KB n = 7
21 Correct 1 ms 4696 KB n = 8
22 Correct 1 ms 4444 KB n = 8
23 Correct 1 ms 4444 KB n = 8
24 Correct 1 ms 4444 KB n = 8
25 Correct 1 ms 4444 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB n = 2
2 Correct 1 ms 2644 KB n = 2
3 Correct 0 ms 2396 KB n = 2
4 Correct 1 ms 2396 KB n = 2
5 Correct 1 ms 2396 KB n = 2
6 Correct 2 ms 2396 KB n = 2
7 Correct 1 ms 2396 KB n = 3
8 Correct 0 ms 2396 KB n = 3
9 Correct 1 ms 2396 KB n = 3
10 Correct 1 ms 4444 KB n = 8
11 Correct 1 ms 4452 KB n = 8
12 Correct 1 ms 4444 KB n = 8
13 Correct 1 ms 4444 KB n = 8
14 Correct 1 ms 4444 KB n = 8
15 Correct 1 ms 4444 KB n = 8
16 Correct 1 ms 4444 KB n = 8
17 Correct 1 ms 4536 KB n = 8
18 Correct 1 ms 4444 KB n = 8
19 Correct 1 ms 2396 KB n = 3
20 Correct 1 ms 4440 KB n = 7
21 Correct 1 ms 4696 KB n = 8
22 Correct 1 ms 4444 KB n = 8
23 Correct 1 ms 4444 KB n = 8
24 Correct 1 ms 4444 KB n = 8
25 Correct 1 ms 4444 KB n = 8
26 Correct 1 ms 4440 KB n = 8
27 Correct 1 ms 4444 KB n = 8
28 Correct 1 ms 4444 KB n = 8
29 Correct 33 ms 8624 KB n = 16
30 Correct 33 ms 8536 KB n = 16
31 Correct 33 ms 8620 KB n = 16
32 Correct 33 ms 8536 KB n = 16
33 Correct 35 ms 9040 KB n = 16
34 Correct 33 ms 8536 KB n = 16
35 Correct 34 ms 8536 KB n = 16
36 Correct 16 ms 7260 KB n = 15
37 Correct 1 ms 4444 KB n = 8
38 Correct 33 ms 8640 KB n = 16
39 Correct 33 ms 8540 KB n = 16
40 Correct 1 ms 4444 KB n = 9
41 Correct 33 ms 8616 KB n = 16
42 Correct 33 ms 8540 KB n = 16
43 Correct 34 ms 8540 KB n = 16
44 Correct 1 ms 4444 KB n = 9
45 Correct 16 ms 7372 KB n = 15
46 Correct 33 ms 8536 KB n = 16
47 Correct 33 ms 8536 KB n = 16
48 Correct 33 ms 8540 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 10572 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 2396 KB n = 2
2 Correct 1 ms 2644 KB n = 2
3 Correct 0 ms 2396 KB n = 2
4 Correct 1 ms 2396 KB n = 2
5 Correct 1 ms 2396 KB n = 2
6 Correct 2 ms 2396 KB n = 2
7 Correct 1 ms 2396 KB n = 3
8 Correct 0 ms 2396 KB n = 3
9 Correct 1 ms 2396 KB n = 3
10 Correct 1 ms 4444 KB n = 8
11 Correct 1 ms 4452 KB n = 8
12 Correct 1 ms 4444 KB n = 8
13 Correct 1 ms 4444 KB n = 8
14 Correct 1 ms 4444 KB n = 8
15 Correct 1 ms 4444 KB n = 8
16 Correct 1 ms 4444 KB n = 8
17 Correct 1 ms 4536 KB n = 8
18 Correct 1 ms 4444 KB n = 8
19 Correct 1 ms 2396 KB n = 3
20 Correct 1 ms 4440 KB n = 7
21 Correct 1 ms 4696 KB n = 8
22 Correct 1 ms 4444 KB n = 8
23 Correct 1 ms 4444 KB n = 8
24 Correct 1 ms 4444 KB n = 8
25 Correct 1 ms 4444 KB n = 8
26 Correct 1 ms 4440 KB n = 8
27 Correct 1 ms 4444 KB n = 8
28 Correct 1 ms 4444 KB n = 8
29 Correct 33 ms 8624 KB n = 16
30 Correct 33 ms 8536 KB n = 16
31 Correct 33 ms 8620 KB n = 16
32 Correct 33 ms 8536 KB n = 16
33 Correct 35 ms 9040 KB n = 16
34 Correct 33 ms 8536 KB n = 16
35 Correct 34 ms 8536 KB n = 16
36 Correct 16 ms 7260 KB n = 15
37 Correct 1 ms 4444 KB n = 8
38 Correct 33 ms 8640 KB n = 16
39 Correct 33 ms 8540 KB n = 16
40 Correct 1 ms 4444 KB n = 9
41 Correct 33 ms 8616 KB n = 16
42 Correct 33 ms 8540 KB n = 16
43 Correct 34 ms 8540 KB n = 16
44 Correct 1 ms 4444 KB n = 9
45 Correct 16 ms 7372 KB n = 15
46 Correct 33 ms 8536 KB n = 16
47 Correct 33 ms 8536 KB n = 16
48 Correct 33 ms 8540 KB n = 16
49 Runtime error 34 ms 10572 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -