# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744801 | Cutebol | Gap (APIO16_gap) | C++17 | 66 ms | 2368 KiB |
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){
if ( T == 1 ){
vector <ll> vec ;
ll l = 1 , r = 1e18 , mn , mx , ans = 0 ;
while ( l <= r ){
if ( vec.size() == n ) break ;
MinMax( l , r , &mn , &mx ) ;
if ( mn == -1 || mx == -1 ) break ;
vec.push_back(mn) ;
if ( mn != mx ) vec.push_back(mx) ;
l = mn + 1 , r = mx-1 ;
}
sort ( vec.begin() , vec.end() ) ;
for ( int i = 1 ; i < n ; i ++ ) ans = max ( ans , vec[i]-vec[i-1] ) ;
return ans ;
}
ll l = 1 , r = 1e18 , x , y, ans = 0 , rr ;
MinMax( l , r , &x , &y ) ;
if ( n == 2 ) return abs(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) ) ;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |