| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1329689 | feyza | Gap (APIO16_gap) | C++20 | 35 ms | 2356 KiB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
vector<ll>v;
long long findGap(int T, int N)
{
ll l=0,r=1e18; int cnt=0;
while(cnt<N && r-l>1)
{
MinMax(l,r,&l,&r);
v.push_back(l);
v.push_back(r);
l++; r--;
cnt+=2;
}
sort(v.begin(),v.end());
ll ans=0;
for(int i=0;i<v.size()-1;i++)
{
ans=max(ans,v[i+1]-v[i]);
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
