| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1168487 | Agageldi | Gap (APIO16_gap) | C++20 | 31 ms | 2340 KiB |
#include "bits/stdc++.h"
#include "gap.h"
// #include "grader.cpp"
using namespace std;
#define ll long long
ll n, l = 0, r = LLONG_MAX, mn = 0, mx = 0;
vector <ll> v;
ll answer;
ll findGap(int T,int N) {
while(n < N && l < r) {
MinMax(l, r, &mn, &mx);
if(mn == -1 || mx == -1) break;
v.push_back(mn);
v.push_back(mx);
n += 2;
l = mn + 1, r = mx - 1;
}
sort(v.begin(),v.end());
for(int i = 0; i < (int)v.size() - 1; i++) {
answer = max(answer,v[i + 1] - v[i]);
}
return answer;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
