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 "gap.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>
using namespace std;
const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;
long long findGap(int T, int N)
{
if(T == 1)
{
long long l = 0;
long long r = inf;
long long rez = 0;
vector<long long> nizl;
vector<long long> nizr;
while(l<=r)
{
long long a;
long long b;
MinMax(l, r, &a ,&b);
if(a==-1)break;
l = a+1;
r = b-1;
if(a!=b)
{
nizl.push_back(a);
nizr.push_back(b);
}
else nizl.pb(a);
}
reverse(all(nizr));
vector<long long> merged(nizl.size()+ nizr.size());
merge(all(nizl), all(nizr), merged.begin());
for(int i=0; i<N-1; i++) rez = max(rez, merged[i+1] - merged[i]);
return rez;
}
else
{
}
}
/*
1 4
2 3 6 8
*/
Compilation message (stderr)
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
51 | }
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |