#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;
}
ll mn,mx;
MinMax(0,inf,&mn,&mx);
ll gap=(mx-mn+n-1-1)/(n-1);
ll ans=gap;
ll x=mn,y=mn;
while(x<mx)
{
ll mn2, mx2;
MinMax(x+1,min(inf,y+gap),&mn2,&mx2);
if(mn2==-1) y+=gap;
else
{
if(mn2==mx2) ans=max(ans,mx2-x);
x=y=mx2;
}
}
return ans;
}
/*
int main()
{
}*/
/*
7 3
4 1 3 4 0 2 3
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
1 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 |
324 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
0 ms |
208 KB |
Output is correct |
| 10 |
Correct |
1 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 |
696 KB |
Output is correct |
| 17 |
Correct |
11 ms |
720 KB |
Output is correct |
| 18 |
Correct |
10 ms |
620 KB |
Output is correct |
| 19 |
Correct |
10 ms |
660 KB |
Output is correct |
| 20 |
Correct |
7 ms |
620 KB |
Output is correct |
| 21 |
Correct |
43 ms |
1756 KB |
Output is correct |
| 22 |
Correct |
36 ms |
1844 KB |
Output is correct |
| 23 |
Correct |
35 ms |
1820 KB |
Output is correct |
| 24 |
Correct |
37 ms |
1760 KB |
Output is correct |
| 25 |
Correct |
33 ms |
1844 KB |
Output is correct |
| 26 |
Correct |
35 ms |
1840 KB |
Output is correct |
| 27 |
Correct |
37 ms |
1832 KB |
Output is correct |
| 28 |
Correct |
43 ms |
1800 KB |
Output is correct |
| 29 |
Correct |
41 ms |
1836 KB |
Output is correct |
| 30 |
Correct |
29 ms |
1864 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 4 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 7 |
Partially correct |
1 ms |
208 KB |
Partially correct |
| 8 |
Partially correct |
1 ms |
208 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 10 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 11 |
Partially correct |
2 ms |
336 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Partially correct |
14 ms |
412 KB |
Partially correct |
| 17 |
Partially correct |
13 ms |
464 KB |
Partially correct |
| 18 |
Partially correct |
15 ms |
504 KB |
Partially correct |
| 19 |
Incorrect |
17 ms |
464 KB |
Output isn't correct |
| 20 |
Incorrect |
7 ms |
504 KB |
Output isn't correct |
| 21 |
Incorrect |
60 ms |
1076 KB |
Output isn't correct |
| 22 |
Incorrect |
58 ms |
1096 KB |
Output isn't correct |
| 23 |
Incorrect |
57 ms |
1084 KB |
Output isn't correct |
| 24 |
Partially correct |
61 ms |
1200 KB |
Partially correct |
| 25 |
Correct |
51 ms |
1092 KB |
Output is correct |
| 26 |
Partially correct |
57 ms |
1092 KB |
Partially correct |
| 27 |
Incorrect |
55 ms |
1048 KB |
Output isn't correct |
| 28 |
Partially correct |
58 ms |
1068 KB |
Partially correct |
| 29 |
Incorrect |
57 ms |
1028 KB |
Output isn't correct |
| 30 |
Incorrect |
27 ms |
1104 KB |
Output isn't correct |
| 31 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
208 KB |
Partially correct |
