| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1362666 | sameer | Gap (APIO16_gap) | C++20 | 22 ms | 2368 KiB |
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
long long findGap(int T, int N){
long long int i, j, n = N, mia, ans, l, r, tl, tr;
vector<long long int> v;
l = 0; r = 1e18;
while(l <= r && v.size() < n){
MinMax(l, r, &tl, &tr);
l = tl; r = tr;
if(l == -1) break;
v.push_back(l); v.push_back(r);
l++; r--;
}
sort(v.begin(), v.end());
for( i = 1, ans = 0; 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... | ||||
