# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390964 | Blagojce | Gap (APIO16_gap) | C++11 | 65 ms | 2236 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>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int mxn = 1e5;
#include "gap.h"
long long findGap(int T, int N)
{
if(T == 1){
ll lb = 0, rb = (1e18);
vector<ll> v;
fr(i, 0, (int)((N+1)/2)){
ll llb, rrb;
MinMax(lb, rb, &llb, &rrb);
if(llb == -1) break;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |