| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1362661 | sameer | Gap (APIO16_gap) | C++20 | 31 ms | 3372 KiB |
#include "gap.h"
#include<vector>
using namespace std;
long long findGap(int T, int N){
long long int i, j, n = N, mia, ans, l, r, tl, tr;
MinMax(0, 1e18, &l, &r);
mia = (r+n-l-2)/(n-1); ans = mia;
vector<long long int> v;
for( i = l; i <= r; i += mia+1){
MinMax(i, i+mia, &tl, &tr);
if(tl != -1){
v.push_back(tl);
v.push_back(tr);
}
}
for( i = 1; i < v.size(); i++) ans = max(ans, v[i]-v[i-1]);
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
