#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll INF=1e18+7;
ll plan_roller_coaster(vector<int>S, vector<int>T) {
int n=S.size();
vector<pair<ll,ll>>V;
rep(i, n) {
V.pb({S[i], 1});
V.pb({T[i], -1});
}
sort(all(V));
ll lst=V[0].st, sum=-1, ans=0;
int czy=0;
for(auto i : V) {
ans+=(i.st-lst)*max(sum, 0ll);
if(i.st!=lst) {
if(sum!=0) {
if(czy==2) {
return 1;
}
czy=1;
} else if(czy==1) czy=2;
}
sum+=i.nd;
lst=i.st;
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
600 KB |
n = 2 |
| 2 |
Correct |
1 ms |
348 KB |
n = 2 |
| 3 |
Correct |
0 ms |
344 KB |
n = 2 |
| 4 |
Correct |
0 ms |
348 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 |
Incorrect |
0 ms |
344 KB |
answer is not correct: 1 instead of 102553483 |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
600 KB |
n = 2 |
| 2 |
Correct |
1 ms |
348 KB |
n = 2 |
| 3 |
Correct |
0 ms |
344 KB |
n = 2 |
| 4 |
Correct |
0 ms |
348 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 |
Incorrect |
0 ms |
344 KB |
answer is not correct: 1 instead of 102553483 |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
90 ms |
12480 KB |
n = 199999 |
| 2 |
Correct |
69 ms |
13508 KB |
n = 199991 |
| 3 |
Correct |
72 ms |
12100 KB |
n = 199993 |
| 4 |
Correct |
56 ms |
12984 KB |
n = 152076 |
| 5 |
Correct |
32 ms |
7368 KB |
n = 93249 |
| 6 |
Correct |
66 ms |
13756 KB |
n = 199910 |
| 7 |
Correct |
64 ms |
12480 KB |
n = 199999 |
| 8 |
Correct |
65 ms |
12732 KB |
n = 199997 |
| 9 |
Correct |
59 ms |
11968 KB |
n = 171294 |
| 10 |
Correct |
50 ms |
10944 KB |
n = 140872 |
| 11 |
Correct |
69 ms |
13488 KB |
n = 199886 |
| 12 |
Correct |
77 ms |
16316 KB |
n = 199996 |
| 13 |
Correct |
66 ms |
16536 KB |
n = 200000 |
| 14 |
Correct |
77 ms |
15040 KB |
n = 199998 |
| 15 |
Correct |
75 ms |
16444 KB |
n = 200000 |
| 16 |
Correct |
66 ms |
15528 KB |
n = 199998 |
| 17 |
Correct |
71 ms |
16328 KB |
n = 200000 |
| 18 |
Correct |
69 ms |
16588 KB |
n = 190000 |
| 19 |
Correct |
69 ms |
15780 KB |
n = 177777 |
| 20 |
Incorrect |
34 ms |
9156 KB |
answer is not correct: 1 instead of 0 |
| 21 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
600 KB |
n = 2 |
| 2 |
Correct |
1 ms |
348 KB |
n = 2 |
| 3 |
Correct |
0 ms |
344 KB |
n = 2 |
| 4 |
Correct |
0 ms |
348 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 |
Incorrect |
0 ms |
344 KB |
answer is not correct: 1 instead of 102553483 |
| 9 |
Halted |
0 ms |
0 KB |
- |
