# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109302 | b2563125 | Gap (APIO16_gap) | C++14 | 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<iostream>
#include<algorithm>
#include<vector>
#include "gap.h"
using namespace std;
#define vel vector<long long>
#define rep(i,n) for(int i=0;i<n;i++)
int pr = 1000000007;
int ref(int &a) {
a = a % pr;
a += pr;
a = a % pr;
return a;
}
long long findGap(int t, int n) {
long long a1, long long an;
long long INF = pr - 7;
INF *= INF;
MinMax(0, INF, &a1, &an);
long long X = an - a1+1;
int now_min = a1;
int ans = 0;
rep(i, n) {
int mn, mx;
MinMax(a1 + (X*i) / n, a1 + (X*(i + 1)) / n, mn, mx);
if (mn != -1) {
ans = max(mn - now_min, ans);
now_min = mx;
}
}
return ans;
}