| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1003470 |
2024-06-20T11:27:56 Z |
amine_aroua |
Gap (APIO16_gap) |
C++17 |
|
41 ms |
2816 KB |
#include <bits/stdc++.h>
using namespace std;
#define intt long long
#define fore(i , n) for(int i = 0 ; i < n; i++)
#define forr(i , x ,y) for(int i = x; i <= y;i++)
#define pb push_back
void MinMax(intt s , intt t , intt *mn , intt *mx);
long long findGap(int T, int N)
{
if(T == 1)
{
intt mn = 0 , mx = 1e18*1LL;
vector<intt> a;
while(mn <= mx)
{
MinMax(mn , mx , &mn , &mx);
if(mn == -1)
break;
a.pb(mn);
if(mn == mx)
break;
a.pb(mx);
mn++;
mx--;
}
sort(a.begin() , a.end());
intt ans = 0;
fore(i , N - 1)
{
ans = max(ans , a[i + 1] - a[i]);
}
return ans;
}
intt mn , mx;
MinMax(0ll , 1LL * 1e18 , &mn , &mx);
intt gmn = mn , gmx = mx;
intt d = (mx - mn + N - 2)/((N - 1));
vector<intt> MinB(N , -1) , MaxB(N , -1);
fore(i , N - 1)
{
intt lt = i * d + gmn , rt = (i + 1)*d + gmn - 1;
MinMax(lt , rt , &mn , &mx);
MinB[i] = mn;
MaxB[i] = mx;
}
if((N - 1) * d + gmn <= gmx)
MinB[N - 1]= MaxB[N - 1] = gmx;
intt prv = MaxB[0];
intt ans = (intt)d;
forr(i , 1 , N - 1)
{
if(MinB[i] == -1)
continue;
ans = max(ans , MaxB[i] - MinB[i]);
ans= max(ans , MinB[i] - prv);
prv = MaxB[i];
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 14 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 16 |
Incorrect |
9 ms |
1028 KB |
Output isn't correct |
| 17 |
Incorrect |
9 ms |
980 KB |
Output isn't correct |
| 18 |
Incorrect |
8 ms |
980 KB |
Output isn't correct |
| 19 |
Incorrect |
7 ms |
980 KB |
Output isn't correct |
| 20 |
Correct |
7 ms |
980 KB |
Output is correct |
| 21 |
Incorrect |
29 ms |
2256 KB |
Output isn't correct |
| 22 |
Incorrect |
29 ms |
2172 KB |
Output isn't correct |
| 23 |
Incorrect |
33 ms |
2256 KB |
Output isn't correct |
| 24 |
Incorrect |
29 ms |
2256 KB |
Output isn't correct |
| 25 |
Incorrect |
26 ms |
2256 KB |
Output isn't correct |
| 26 |
Incorrect |
39 ms |
2256 KB |
Output isn't correct |
| 27 |
Incorrect |
29 ms |
2256 KB |
Output isn't correct |
| 28 |
Incorrect |
38 ms |
2220 KB |
Output isn't correct |
| 29 |
Incorrect |
29 ms |
2256 KB |
Output isn't correct |
| 30 |
Correct |
30 ms |
2256 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
376 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
8 ms |
860 KB |
Output is correct |
| 17 |
Correct |
8 ms |
856 KB |
Output is correct |
| 18 |
Correct |
8 ms |
1052 KB |
Output is correct |
| 19 |
Correct |
8 ms |
856 KB |
Output is correct |
| 20 |
Correct |
6 ms |
1052 KB |
Output is correct |
| 21 |
Correct |
41 ms |
2804 KB |
Output is correct |
| 22 |
Correct |
35 ms |
2648 KB |
Output is correct |
| 23 |
Correct |
35 ms |
2648 KB |
Output is correct |
| 24 |
Correct |
37 ms |
2648 KB |
Output is correct |
| 25 |
Correct |
33 ms |
2648 KB |
Output is correct |
| 26 |
Correct |
36 ms |
2648 KB |
Output is correct |
| 27 |
Correct |
35 ms |
2648 KB |
Output is correct |
| 28 |
Correct |
35 ms |
2648 KB |
Output is correct |
| 29 |
Correct |
35 ms |
2648 KB |
Output is correct |
| 30 |
Correct |
20 ms |
2816 KB |
Output is correct |
| 31 |
Correct |
1 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
