| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1329450 | ahmetlbktd4 | Gap (APIO16_gap) | C++20 | 34 ms | 1940 KiB |
#include "bits/stdc++.h"
#include "gap.h"
#define ll long long
using namespace std;
const int N = 2e5+5;
ll a[N];
int in = 0;
ll findGap(int t, int n){
if (t == 1){
ll l = 0,r = 1e18;
ll mn,mx;
for (int i = 0;i < (n+1)>>1;i++){
MinMax(l,r,&mn,&mx);
l = mn+1;
r = mx-1;
a[in] = mn;
in++;
a[in] = mx;
in++;
}
sort(a,a+n);
ll p = 0;
for (int i = 1;i < in;i++){
p = max(p,a[i]-a[i-1]);
}
return p;
}
else {
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
