oj.uz

답안 #297895

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297895 2020-09-12T06:25:12 Z Dovran Roller Coaster Railroad (IOI16_railroad) C++11
11 / 100
 2000 ms 9644 KB 
#include <bits/stdc++.h>
#define N 200009
#define ll long long
#define pii pair <ll, ll>
#define ff first
#define sz() size()
#define ss second
#define pb push_back

using namespace std;

ll n;
ll vis[N];
ll v[N];
pii p[N];
ll ans=1e18;

void f(int x){
	if(x==n){
		ll sum=0, y=1;
		for(int i=0; i<n; i++){
			if(y>p[v[i]].ff)
				sum+=y-p[v[i]].ff;
			y=p[v[i]].ss;
		}
		ans=min(ans, sum);
		return;
	}
	for(int i=0; i<n; i++){
		if(!vis[i]){
			vis[i]=1;
			v[x]=i;
			f(x+1);
			vis[i]=0;
		}
	}
}

ll plan_roller_coaster(vector<int>a, vector<int>b){
	n=a.size();
	for(int i=0; i<n; i++)
		p[i]={a[i], b[i]};
	f(0);
	return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB n = 2
2 Correct 0 ms 384 KB n = 2
3 Correct 0 ms 384 KB n = 2
4 Correct 1 ms 384 KB n = 2
5 Correct 1 ms 384 KB n = 2
6 Correct 0 ms 384 KB n = 2
7 Correct 0 ms 384 KB n = 3
8 Correct 0 ms 384 KB n = 3
9 Correct 1 ms 384 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 3 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 3 ms 384 KB n = 8
16 Correct 2 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 2 ms 384 KB n = 8
19 Correct 0 ms 384 KB n = 3
20 Correct 1 ms 384 KB n = 7
21 Correct 3 ms 384 KB n = 8
22 Correct 2 ms 288 KB n = 8
23 Correct 3 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB n = 2
2 Correct 0 ms 384 KB n = 2
3 Correct 0 ms 384 KB n = 2
4 Correct 1 ms 384 KB n = 2
5 Correct 1 ms 384 KB n = 2
6 Correct 0 ms 384 KB n = 2
7 Correct 0 ms 384 KB n = 3
8 Correct 0 ms 384 KB n = 3
9 Correct 1 ms 384 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 3 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 3 ms 384 KB n = 8
16 Correct 2 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 2 ms 384 KB n = 8
19 Correct 0 ms 384 KB n = 3
20 Correct 1 ms 384 KB n = 7
21 Correct 3 ms 384 KB n = 8
22 Correct 2 ms 288 KB n = 8
23 Correct 3 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 2 ms 384 KB n = 8
27 Correct 2 ms 384 KB n = 8
28 Correct 3 ms 384 KB n = 8
29 Execution timed out 2096 ms 256 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2084 ms 9644 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB n = 2
2 Correct 0 ms 384 KB n = 2
3 Correct 0 ms 384 KB n = 2
4 Correct 1 ms 384 KB n = 2
5 Correct 1 ms 384 KB n = 2
6 Correct 0 ms 384 KB n = 2
7 Correct 0 ms 384 KB n = 3
8 Correct 0 ms 384 KB n = 3
9 Correct 1 ms 384 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 3 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 3 ms 384 KB n = 8
16 Correct 2 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 2 ms 384 KB n = 8
19 Correct 0 ms 384 KB n = 3
20 Correct 1 ms 384 KB n = 7
21 Correct 3 ms 384 KB n = 8
22 Correct 2 ms 288 KB n = 8
23 Correct 3 ms 384 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 2 ms 384 KB n = 8
27 Correct 2 ms 384 KB n = 8
28 Correct 3 ms 384 KB n = 8
29 Execution timed out 2096 ms 256 KB Time limit exceeded
30 Halted 0 ms 0 KB -