Submission #958827

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
958827	2024-04-06T23:38:05 Z	MinaRagy06	Roller Coaster Railroad (IOI16_railroad)	C++17	11 / 100	2000 ms	8028 KB

railroad

#include <bits/stdc++.h>
#include "railroad.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long

ll plan_roller_coaster(vector<int> s, vector<int> t) {
	int n = s.size();
	int a[n];
	for (int i = 0; i < n; i++) {
		a[i] = i;
	}
	ll ans = 1e18;
	do {
		ll sum = 0;
		for (int i = 0; i + 1 < n; i++) {
			sum += max(0, t[a[i]] - s[a[i + 1]]);
		}
		ans = min(ans, sum);
	} while (next_permutation(a, a + n));
	return ans;
}

Subtask #1

11.0 / 11.0

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

Subtask #2

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	n = 2
2	Correct	0 ms	348 KB	n = 2
3	Correct	1 ms	360 KB	n = 2
4	Correct	0 ms	692 KB	n = 2
5	Correct	0 ms	348 KB	n = 2
6	Correct	0 ms	348 KB	n = 2
7	Correct	0 ms	348 KB	n = 3
8	Correct	0 ms	348 KB	n = 3
9	Correct	0 ms	348 KB	n = 3
10	Correct	1 ms	348 KB	n = 8
11	Correct	1 ms	348 KB	n = 8
12	Correct	1 ms	348 KB	n = 8
13	Correct	1 ms	344 KB	n = 8
14	Correct	1 ms	344 KB	n = 8
15	Correct	1 ms	348 KB	n = 8
16	Correct	1 ms	348 KB	n = 8
17	Correct	1 ms	348 KB	n = 8
18	Correct	1 ms	348 KB	n = 8
19	Correct	0 ms	344 KB	n = 3
20	Correct	1 ms	344 KB	n = 7
21	Correct	1 ms	348 KB	n = 8
22	Correct	1 ms	348 KB	n = 8
23	Correct	1 ms	348 KB	n = 8
24	Correct	1 ms	348 KB	n = 8
25	Correct	1 ms	436 KB	n = 8
26	Correct	1 ms	504 KB	n = 8
27	Correct	1 ms	344 KB	n = 8
28	Correct	1 ms	344 KB	n = 8
29	Execution timed out	2045 ms	500 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	2039 ms	8028 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 36.0

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