| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 978073 | IUA_Hasin | Gap (APIO16_gap) | C++17 | 42 ms | 4724 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>
#define ll long long
using namespace std;
long long findGap(int T, int N)
{
ll tempa = 0;
ll tempb = 1e18;
ll arr[N];
ll l = 0;
ll r = N-1;
// cout<<tempa<< " " << tempb<<endl;
while(true){
if(l<=r){
ll mn, mx;
MinMax(tempa, tempb, &mn, &mx);
// cout<<mn<<" "<<mx<<endl;
if(mn==-1 || mx==-1){
break;
} else if(mn==mx){
arr[l] = mn;
break;
} else {
tempa = mn+1;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||