| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 742028 | vjudge1 | Gap (APIO16_gap) | C++17 | 0 ms | 0 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 <stdio.h>
#include <stdlib.h>
#include "gap.h"
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
int lo = 1, hi = N, left = N+1, right = 0;
my_assert(s <= t && mn != NULL && mx != NULL);
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] >= s) hi = mid - 1, left = mid;
else lo = mid + 1;
}
lo = 1, hi = N;
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] <= t) lo = mid + 1, right = mid;
else hi = mid - 1;
}
if (left > right) *mn = *mx = -1;
else{
*mn = A[left];
*mx = A[right];
}
if (subtask_num == 1) call_count++;
else if (subtask_num == 2) call_count += right-left+2;
}
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
long long findGap(int T, int N){
long long l = 0, r = 1e18;
vector<long long>a;
long long mn, mx;
long long L[N+1], R[N+1];
MinMax(l, r, &mn, &mx);
long long len = mx-mn+1;
R[0] = mn-1;
for(int i=1; i<N; i++){
L[i] = R[i-1] + 1;
R[i] = L[i] + len/(N-1);
if(i > len%(N-1)) R[i]--;
MinMax(L[i], R[i], &mn, &mx);
a.push_back(mn);
a.push_back(mx);
}
long long ans = (len+N-2) / (N-1);
sort(a.begin(), a.end());
for(int i=1; i<a.size(); i++) ans = max(ans, a[i]-a[i-1]);
return ans;
}
int main(){
FILE *in = stdin, *out = stdout;
my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
my_assert(1 <= subtask_num && subtask_num <= 2);
my_assert(2 <= N && N <= 100000);
for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
fprintf(out, "%lld\n", findGap(subtask_num, N));
fprintf(out, "%lld\n", call_count);
}