# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
614091 |
2022-07-30T18:36:17 Z |
nohaxjustsoflo |
Gap (APIO16_gap) |
C++17 |
|
40 ms |
1864 KB |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen; ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN=1e5+5;
const int mod=998244353;
const int mxlogN=40;
const int mxK=26;
const ll inf=1e18;
const int K=600;
void MinMax(ll s, ll t, ll *mn, ll *mx);
ll a[mxN];
ll findGap(int T, int N)
{
if(T==1)
{
ll mn=0,mx=inf;
for(int l=0, r=N-1; l<=r; l++, r--)
{
MinMax(mn,mx,&a[l],&a[r]);
mn=a[l]+1;
mx=a[r]-1;
}
ll ans=0;
for(int i=1; i<N; i++) ans=max(ans,a[i]-a[i-1]);
return ans;
}
return 0;
}
/*
int main()
{
}*/
/*
7 3
4 1 3 4 0 2 3
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
0 ms |
208 KB |
Output is correct |
7 |
Correct |
0 ms |
208 KB |
Output is correct |
8 |
Correct |
0 ms |
208 KB |
Output is correct |
9 |
Correct |
0 ms |
208 KB |
Output is correct |
10 |
Correct |
0 ms |
208 KB |
Output is correct |
11 |
Correct |
1 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
16 |
Correct |
9 ms |
640 KB |
Output is correct |
17 |
Correct |
9 ms |
680 KB |
Output is correct |
18 |
Correct |
9 ms |
644 KB |
Output is correct |
19 |
Correct |
9 ms |
612 KB |
Output is correct |
20 |
Correct |
7 ms |
720 KB |
Output is correct |
21 |
Correct |
33 ms |
1840 KB |
Output is correct |
22 |
Correct |
34 ms |
1836 KB |
Output is correct |
23 |
Correct |
39 ms |
1832 KB |
Output is correct |
24 |
Correct |
40 ms |
1864 KB |
Output is correct |
25 |
Correct |
33 ms |
1856 KB |
Output is correct |
26 |
Correct |
34 ms |
1824 KB |
Output is correct |
27 |
Correct |
40 ms |
1864 KB |
Output is correct |
28 |
Correct |
36 ms |
1768 KB |
Output is correct |
29 |
Correct |
33 ms |
1824 KB |
Output is correct |
30 |
Correct |
28 ms |
1836 KB |
Output is correct |
31 |
Correct |
0 ms |
208 KB |
Output is correct |
32 |
Correct |
0 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
16 |
Incorrect |
4 ms |
464 KB |
Output isn't correct |
17 |
Incorrect |
5 ms |
508 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
464 KB |
Output isn't correct |
19 |
Incorrect |
5 ms |
408 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
592 KB |
Output isn't correct |
21 |
Incorrect |
16 ms |
1072 KB |
Output isn't correct |
22 |
Incorrect |
16 ms |
968 KB |
Output isn't correct |
23 |
Incorrect |
16 ms |
968 KB |
Output isn't correct |
24 |
Incorrect |
16 ms |
1040 KB |
Output isn't correct |
25 |
Incorrect |
12 ms |
1084 KB |
Output isn't correct |
26 |
Incorrect |
16 ms |
1072 KB |
Output isn't correct |
27 |
Incorrect |
16 ms |
1068 KB |
Output isn't correct |
28 |
Incorrect |
15 ms |
1072 KB |
Output isn't correct |
29 |
Incorrect |
16 ms |
1072 KB |
Output isn't correct |
30 |
Incorrect |
9 ms |
1080 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |