This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gap.h"
#include <bits/stdc++.h>
using namespace std ;
#define ll long long
const int inf = 1e18 ;
ll findGap(int T , int n){
ll l = 1 , r = 1e18 , x , y, ans = 0 , rr ;
MinMax( l , r , &x , &y ) ;
rr = y ;
ll len = (y-x-1)/(n-1) ;
l = x , r = y ;
MinMax( x+1 , x+len+((y-x-1)%(n-1)) , &l , &r ) ;
if ( l != -1 ) ans = max ( ans , abs(x-l) ) ;
x += len+((y-x-1)%(n-1)) ; y = r ;
for ( ll i = 1 ; i < n-1 ; i ++ ){
MinMax( x+1 , x+len , &l , &r ) ;
x += len ;
if ( l == -1 ) continue ;
ans = max ( ans , abs( y-l ) ) ;
y = r ;
}
ans = max ( ans , abs(y-rr) ) ;
return ans ;
}
Compilation message (stderr)
gap.cpp:5:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
5 | const int inf = 1e18 ;
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |