/* Bismillahir Rahmanir Rahim */
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e18;
long long mdiff = 0;
void solve(long long st, long long en, long long cnt){
if(st > en) return;
long long rng = 1LL + (en - st + 1LL) / cnt;
vector<long long>mn, mx;
for(long long i=st;i<=en;i+=rng){
long long A, B;
MinMax(i, min(i + rng - 1LL, en), &A, &B);
if(A == -1) continue;
mn.push_back(A);
mx.push_back(B);
cnt -= 1 + (A != B);
}
for(int i=1;i<mn.size();i++) mdiff = max(mdiff, mn[i] - mx[i-1]);
for(int i=0;i<mn.size();i++){
if(mx[i] - mn[i] > mdiff) solve(mn[i], mx[i], cnt+1);
}
}
long long findGap(int T, int N){
solve(0, M, N);
return mdiff;
}
Compilation message
gap.cpp: In function 'void solve(long long int, long long int, long long int)':
gap.cpp:24:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1;i<mn.size();i++) mdiff = max(mdiff, mn[i] - mx[i-1]);
^
gap.cpp:25:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<mn.size();i++){
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 11 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 12 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 13 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 14 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 15 |
Incorrect |
0 ms |
5276 KB |
Output isn't correct |
| 16 |
Incorrect |
16 ms |
5436 KB |
Output isn't correct |
| 17 |
Incorrect |
16 ms |
5436 KB |
Output isn't correct |
| 18 |
Incorrect |
16 ms |
5436 KB |
Output isn't correct |
| 19 |
Incorrect |
16 ms |
5436 KB |
Output isn't correct |
| 20 |
Incorrect |
9 ms |
5144 KB |
Output isn't correct |
| 21 |
Incorrect |
69 ms |
6516 KB |
Output isn't correct |
| 22 |
Incorrect |
79 ms |
6516 KB |
Output isn't correct |
| 23 |
Incorrect |
89 ms |
6516 KB |
Output isn't correct |
| 24 |
Incorrect |
83 ms |
6516 KB |
Output isn't correct |
| 25 |
Incorrect |
89 ms |
7796 KB |
Output isn't correct |
| 26 |
Incorrect |
73 ms |
6516 KB |
Output isn't correct |
| 27 |
Incorrect |
73 ms |
6516 KB |
Output isn't correct |
| 28 |
Incorrect |
83 ms |
6516 KB |
Output isn't correct |
| 29 |
Incorrect |
79 ms |
6516 KB |
Output isn't correct |
| 30 |
Incorrect |
59 ms |
5440 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 5 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 6 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 10 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 11 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 15 |
Partially correct |
0 ms |
5276 KB |
Partially correct |
| 16 |
Correct |
16 ms |
5436 KB |
Output is correct |
| 17 |
Correct |
16 ms |
5436 KB |
Output is correct |
| 18 |
Correct |
16 ms |
5436 KB |
Output is correct |
| 19 |
Correct |
16 ms |
5436 KB |
Output is correct |
| 20 |
Partially correct |
13 ms |
5144 KB |
Partially correct |
| 21 |
Correct |
76 ms |
6516 KB |
Output is correct |
| 22 |
Correct |
76 ms |
6516 KB |
Output is correct |
| 23 |
Correct |
69 ms |
6516 KB |
Output is correct |
| 24 |
Correct |
69 ms |
6516 KB |
Output is correct |
| 25 |
Partially correct |
86 ms |
7796 KB |
Partially correct |
| 26 |
Correct |
69 ms |
6516 KB |
Output is correct |
| 27 |
Correct |
69 ms |
6516 KB |
Output is correct |
| 28 |
Correct |
73 ms |
6516 KB |
Output is correct |
| 29 |
Correct |
79 ms |
6516 KB |
Output is correct |
| 30 |
Partially correct |
56 ms |
5440 KB |
Partially correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
