#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#ifdef dremix
#define p(x) cerr<<#x<<" = "<<x<<endl;
#define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
#define pp(x) cerr<<#x<<" = ("<<x.F<<" - "<<x.S<<")"<<endl;
#define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
#define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
#define p(x) {}
#define p2(x,y) {}
#define pp(x) {}
#define pv(x) {}
#define ppv(x) {}
#endif
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const int N = 3e5+5;
const int MOD = 1e9+7;
const ll INF = 1e18+5;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
vector<int> idx(n);
iota(all(idx),0);
ll ans = INF;
int i;
do{
int curr = 1;
ll res = 0;
for(i=0;i<n;i++){
int j = idx[i];
res += max(0,curr - s[j]);
curr = t[j];
}
ans = min(ans,res);
}while(next_permutation(all(idx)));
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
212 KB |
n = 2 |
6 |
Correct |
0 ms |
212 KB |
n = 2 |
7 |
Correct |
1 ms |
276 KB |
n = 3 |
8 |
Correct |
1 ms |
212 KB |
n = 3 |
9 |
Correct |
0 ms |
212 KB |
n = 3 |
10 |
Correct |
1 ms |
212 KB |
n = 8 |
11 |
Correct |
1 ms |
212 KB |
n = 8 |
12 |
Correct |
1 ms |
212 KB |
n = 8 |
13 |
Correct |
1 ms |
212 KB |
n = 8 |
14 |
Correct |
1 ms |
212 KB |
n = 8 |
15 |
Correct |
1 ms |
296 KB |
n = 8 |
16 |
Correct |
1 ms |
304 KB |
n = 8 |
17 |
Correct |
1 ms |
304 KB |
n = 8 |
18 |
Correct |
1 ms |
212 KB |
n = 8 |
19 |
Correct |
1 ms |
212 KB |
n = 3 |
20 |
Correct |
1 ms |
212 KB |
n = 7 |
21 |
Correct |
1 ms |
212 KB |
n = 8 |
22 |
Correct |
1 ms |
212 KB |
n = 8 |
23 |
Correct |
1 ms |
212 KB |
n = 8 |
24 |
Correct |
1 ms |
300 KB |
n = 8 |
25 |
Correct |
1 ms |
212 KB |
n = 8 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
212 KB |
n = 2 |
6 |
Correct |
0 ms |
212 KB |
n = 2 |
7 |
Correct |
1 ms |
276 KB |
n = 3 |
8 |
Correct |
1 ms |
212 KB |
n = 3 |
9 |
Correct |
0 ms |
212 KB |
n = 3 |
10 |
Correct |
1 ms |
212 KB |
n = 8 |
11 |
Correct |
1 ms |
212 KB |
n = 8 |
12 |
Correct |
1 ms |
212 KB |
n = 8 |
13 |
Correct |
1 ms |
212 KB |
n = 8 |
14 |
Correct |
1 ms |
212 KB |
n = 8 |
15 |
Correct |
1 ms |
296 KB |
n = 8 |
16 |
Correct |
1 ms |
304 KB |
n = 8 |
17 |
Correct |
1 ms |
304 KB |
n = 8 |
18 |
Correct |
1 ms |
212 KB |
n = 8 |
19 |
Correct |
1 ms |
212 KB |
n = 3 |
20 |
Correct |
1 ms |
212 KB |
n = 7 |
21 |
Correct |
1 ms |
212 KB |
n = 8 |
22 |
Correct |
1 ms |
212 KB |
n = 8 |
23 |
Correct |
1 ms |
212 KB |
n = 8 |
24 |
Correct |
1 ms |
300 KB |
n = 8 |
25 |
Correct |
1 ms |
212 KB |
n = 8 |
26 |
Correct |
1 ms |
212 KB |
n = 8 |
27 |
Correct |
1 ms |
212 KB |
n = 8 |
28 |
Correct |
1 ms |
300 KB |
n = 8 |
29 |
Execution timed out |
2059 ms |
212 KB |
Time limit exceeded |
30 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2093 ms |
5480 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
212 KB |
n = 2 |
6 |
Correct |
0 ms |
212 KB |
n = 2 |
7 |
Correct |
1 ms |
276 KB |
n = 3 |
8 |
Correct |
1 ms |
212 KB |
n = 3 |
9 |
Correct |
0 ms |
212 KB |
n = 3 |
10 |
Correct |
1 ms |
212 KB |
n = 8 |
11 |
Correct |
1 ms |
212 KB |
n = 8 |
12 |
Correct |
1 ms |
212 KB |
n = 8 |
13 |
Correct |
1 ms |
212 KB |
n = 8 |
14 |
Correct |
1 ms |
212 KB |
n = 8 |
15 |
Correct |
1 ms |
296 KB |
n = 8 |
16 |
Correct |
1 ms |
304 KB |
n = 8 |
17 |
Correct |
1 ms |
304 KB |
n = 8 |
18 |
Correct |
1 ms |
212 KB |
n = 8 |
19 |
Correct |
1 ms |
212 KB |
n = 3 |
20 |
Correct |
1 ms |
212 KB |
n = 7 |
21 |
Correct |
1 ms |
212 KB |
n = 8 |
22 |
Correct |
1 ms |
212 KB |
n = 8 |
23 |
Correct |
1 ms |
212 KB |
n = 8 |
24 |
Correct |
1 ms |
300 KB |
n = 8 |
25 |
Correct |
1 ms |
212 KB |
n = 8 |
26 |
Correct |
1 ms |
212 KB |
n = 8 |
27 |
Correct |
1 ms |
212 KB |
n = 8 |
28 |
Correct |
1 ms |
300 KB |
n = 8 |
29 |
Execution timed out |
2059 ms |
212 KB |
Time limit exceeded |
30 |
Halted |
0 ms |
0 KB |
- |