#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
ll n=N,m=M;
vector<ll>t;
for(int i=0;i<m;i++)
t.pb(T[i]);
for(int i=0;i<n-2*m;i++)
t.pb(0);
sort(all(t));
return max(((t.size()>=2)?t[t.size()-1] + t[t.size()-2] + L : 0),((t.size()>=3)? t[t.size()-2] + t[t.size()-3] + 2*L:0));
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
3792 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
3792 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
1752 KB |
Output is correct |
2 |
Correct |
6 ms |
1792 KB |
Output is correct |
3 |
Correct |
7 ms |
1748 KB |
Output is correct |
4 |
Correct |
6 ms |
1752 KB |
Output is correct |
5 |
Correct |
6 ms |
1748 KB |
Output is correct |
6 |
Correct |
7 ms |
2260 KB |
Output is correct |
7 |
Correct |
7 ms |
1888 KB |
Output is correct |
8 |
Correct |
7 ms |
1748 KB |
Output is correct |
9 |
Correct |
6 ms |
1752 KB |
Output is correct |
10 |
Correct |
6 ms |
1720 KB |
Output is correct |
11 |
Correct |
0 ms |
344 KB |
Output is correct |
12 |
Correct |
2 ms |
1492 KB |
Output is correct |
13 |
Correct |
2 ms |
1492 KB |
Output is correct |
14 |
Correct |
2 ms |
1488 KB |
Output is correct |
15 |
Correct |
2 ms |
1492 KB |
Output is correct |
16 |
Correct |
2 ms |
1492 KB |
Output is correct |
17 |
Correct |
2 ms |
1492 KB |
Output is correct |
18 |
Correct |
2 ms |
1492 KB |
Output is correct |
19 |
Correct |
2 ms |
1492 KB |
Output is correct |
20 |
Correct |
0 ms |
440 KB |
Output is correct |
21 |
Correct |
0 ms |
348 KB |
Output is correct |
22 |
Correct |
0 ms |
348 KB |
Output is correct |
23 |
Correct |
3 ms |
1748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
3792 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |