# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
323192 | couplefire | Gap (APIO16_gap) | C++17 | 58 ms | 3168 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 <bits/stdc++.h>
using namespace std;
long long solve1(int n){
queue<long long> left; stack<long long> right;
long long cl = 0, cr = 1000000000000000000;
while(left.size()+right.size() < n){
long long a, b;
MinMax(cl, cr, &a, &b);
left.push(a); right.push(b);
cr = b-1, cl = a+1;
}
vector<long long> v;
while(!left.empty()){
v.push_back(left.front());
left.pop();
}
while(!right.empty()){
v.push_back(right.top());
right.pop();
}
long long ans = 0;
for(int i = 1; i<v.size(); i++) ans = max(ans, v[i]-v[i-1]);
return ans;
}
void solve2(int n){
}
long long findGap(int T, int N){
if(T == 2) return solve1(N);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |