| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1153384 | AlgorithmWarrior | Gap (APIO16_gap) | C++20 | 43 ms | 1188 KiB |
#include <bits/stdc++.h>
using namespace std;
#include "gap.h"
void maxself(long long& x,long long val){
if(x<val)
x=val;
}
long long findGap(int T, int N){
if(T==1){
long long st,dr;
MinMax(0,1e18,&st,&dr);
long long answer=1;
int i;
for(i=1;i<=(N-1)/2;++i){
long long ultst=st;
long long ultdr=dr;
MinMax(ultst+1,ultdr-1,&st,&dr);
maxself(answer,st-ultst);
maxself(answer,ultdr-dr);
}
maxself(answer,dr-st);
return answer;
}
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
