# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45844 | gnoor | Gap (APIO16_gap) | C++17 | 104 ms | 2652 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 "gap.h"
#include <cmath>
#include <cstdio>
#ifdef debug
#include "grader.cpp"
#endif
#include <vector>
#include <algorithm>
using namespace std;
long long findGap(int T, int N)
{
if (T==1) {
vector<long long> tbl;
long long mn,mx;
long long left=0;
long long rgt=1e18;
int x=(N+1)/2;
for (int i=0;i<x;i++) {
MinMax(left,rgt,&mn,&mx);
tbl.push_back(mn);
if (mx!=mn) tbl.push_back(mx);
left=mn+1;
rgt=mx-1;
}
sort(tbl.begin(),tbl.end());
long long ans=0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |