| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1091027 | Nurislam | Gap (APIO16_gap) | C++17 | 38 ms | 2384 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 <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#include "gap.h"
typedef long long ll;
ll solve1(int t, int n){
ll l = 0, r = 1e18;
vector<ll> a;
ll lf = 1, rf = 1;
while(1){
MinMax(l, r, &lf, &rf);
if(lf == -1)break;
a.pb(lf);
a.pb(rf);
l = lf+1, r = rf-1;
if(lf == rf || a.size() >= n)break;
}
ll ans = 1;
sort(all(a));
//for(auto i:a)cout << i << ' ';
//cout << '\n';
for(int i = 1; i < a.size(); i++)
ans = max(ans, a[i] - a[i-1]);
return ans;
}
long long findGap(int t, int n)
{
//if(t == 1){
return solve1(t, n);
//}
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
