Submission #299397

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
299397	2020-09-14T20:30:47 Z	APROHACK	Roller Coaster Railroad (IOI16_railroad)	C++14	11 / 100	2000 ms	4720 KB

railroad

#include "railroad.h"
#include<bits/stdc++.h>
#define PB push_back
using namespace std;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    vector<int>permutacion;
    for(int i = 0 ;i < n ; i ++){
    	permutacion.PB(i);
	}
	long long ret=-1, sum=0, vel;
	do{
		sum=0, vel=1;
		for(int i = 0 ; i < n ; i ++){
			if(vel<=s[permutacion[i]]){
				
			}else{
				sum+=vel-s[permutacion[i]];
			}
			vel=t[permutacion[i]];
		}
		if(ret==-1)ret=sum;
		else ret=min(ret, sum);
	}while(next_permutation(permutacion.begin(), permutacion.end()));
    return ret;
}

Subtask #1

11.0 / 11.0

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

Subtask #2

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	n = 2
2	Correct	0 ms	256 KB	n = 2
3	Correct	0 ms	256 KB	n = 2
4	Correct	0 ms	256 KB	n = 2
5	Correct	0 ms	256 KB	n = 2
6	Correct	0 ms	256 KB	n = 2
7	Correct	0 ms	256 KB	n = 3
8	Correct	0 ms	256 KB	n = 3
9	Correct	0 ms	256 KB	n = 3
10	Correct	1 ms	256 KB	n = 8
11	Correct	1 ms	256 KB	n = 8
12	Correct	1 ms	256 KB	n = 8
13	Correct	1 ms	256 KB	n = 8
14	Correct	1 ms	256 KB	n = 8
15	Correct	1 ms	256 KB	n = 8
16	Correct	1 ms	256 KB	n = 8
17	Correct	1 ms	256 KB	n = 8
18	Correct	1 ms	256 KB	n = 8
19	Correct	1 ms	256 KB	n = 3
20	Correct	1 ms	256 KB	n = 7
21	Correct	1 ms	384 KB	n = 8
22	Correct	1 ms	256 KB	n = 8
23	Correct	1 ms	256 KB	n = 8
24	Correct	1 ms	256 KB	n = 8
25	Correct	1 ms	256 KB	n = 8
26	Correct	1 ms	256 KB	n = 8
27	Correct	1 ms	256 KB	n = 8
28	Correct	1 ms	256 KB	n = 8
29	Execution timed out	2058 ms	384 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #3

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2056 ms	4720 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	n = 2
2	Correct	0 ms	256 KB	n = 2
3	Correct	0 ms	256 KB	n = 2
4	Correct	0 ms	256 KB	n = 2
5	Correct	0 ms	256 KB	n = 2
6	Correct	0 ms	256 KB	n = 2
7	Correct	0 ms	256 KB	n = 3
8	Correct	0 ms	256 KB	n = 3
9	Correct	0 ms	256 KB	n = 3
10	Correct	1 ms	256 KB	n = 8
11	Correct	1 ms	256 KB	n = 8
12	Correct	1 ms	256 KB	n = 8
13	Correct	1 ms	256 KB	n = 8
14	Correct	1 ms	256 KB	n = 8
15	Correct	1 ms	256 KB	n = 8
16	Correct	1 ms	256 KB	n = 8
17	Correct	1 ms	256 KB	n = 8
18	Correct	1 ms	256 KB	n = 8
19	Correct	1 ms	256 KB	n = 3
20	Correct	1 ms	256 KB	n = 7
21	Correct	1 ms	384 KB	n = 8
22	Correct	1 ms	256 KB	n = 8
23	Correct	1 ms	256 KB	n = 8
24	Correct	1 ms	256 KB	n = 8
25	Correct	1 ms	256 KB	n = 8
26	Correct	1 ms	256 KB	n = 8
27	Correct	1 ms	256 KB	n = 8
28	Correct	1 ms	256 KB	n = 8
29	Execution timed out	2058 ms	384 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-