| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 875931 |
2023-11-20T19:03:31 Z |
Lobo |
Gap (APIO16_gap) |
C++17 |
|
38 ms |
3108 KB |
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
int findGap(int32_t T, int32_t n)
{
int a1,an;
MinMax(0,(int) 1e18,&a1,&an);
int gap = (an-a1)/(n-1);
int ant = a1;
for(int i = a1; i <= an; i+= gap+1) {
int mn,mx;
MinMax(i,i+gap,&mn,&mx);
if(mn == -1) continue;
gap = max(gap,mn-ant);
ant = mx;
}
return gap;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
2392 KB |
Output isn't correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
2644 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 16 |
Correct |
5 ms |
2388 KB |
Output is correct |
| 17 |
Correct |
5 ms |
2592 KB |
Output is correct |
| 18 |
Correct |
4 ms |
2588 KB |
Output is correct |
| 19 |
Correct |
5 ms |
2580 KB |
Output is correct |
| 20 |
Incorrect |
3 ms |
2568 KB |
Output isn't correct |
| 21 |
Correct |
17 ms |
2852 KB |
Output is correct |
| 22 |
Correct |
21 ms |
2856 KB |
Output is correct |
| 23 |
Correct |
19 ms |
2856 KB |
Output is correct |
| 24 |
Correct |
17 ms |
2860 KB |
Output is correct |
| 25 |
Incorrect |
38 ms |
3108 KB |
Output isn't correct |
| 26 |
Correct |
16 ms |
2856 KB |
Output is correct |
| 27 |
Correct |
16 ms |
2852 KB |
Output is correct |
| 28 |
Correct |
22 ms |
2856 KB |
Output is correct |
| 29 |
Correct |
17 ms |
3044 KB |
Output is correct |
| 30 |
Incorrect |
14 ms |
2860 KB |
Output isn't correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
5 ms |
2588 KB |
Output is correct |
| 17 |
Correct |
5 ms |
2584 KB |
Output is correct |
| 18 |
Correct |
5 ms |
2584 KB |
Output is correct |
| 19 |
Correct |
4 ms |
2584 KB |
Output is correct |
| 20 |
Incorrect |
3 ms |
2784 KB |
Output isn't correct |
| 21 |
Correct |
16 ms |
2856 KB |
Output is correct |
| 22 |
Correct |
17 ms |
2860 KB |
Output is correct |
| 23 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 24 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 25 |
Correct |
38 ms |
2856 KB |
Output is correct |
| 26 |
Correct |
17 ms |
2852 KB |
Output is correct |
| 27 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 28 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 29 |
Correct |
17 ms |
2852 KB |
Output is correct |
| 30 |
Incorrect |
14 ms |
2848 KB |
Output isn't correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
