| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1169800 | Agageldi | Gap (APIO16_gap) | C++20 | 44 ms | 1192 KiB |
#include "bits/stdc++.h"
#include "gap.h"
// #include "grader.cpp"
using namespace std;
#define ll long long
#define pb push_back
ll n, s, answer, l1, mn, mx, ans, l, r;
ll findGap(int T,int N) {
MinMax(0, LLONG_MAX, &l, &r);
ll thr = (r - l - 3 + N) / (N - 1);
l1 = l;
while(l < r) {
MinMax(l, min(l + thr, r), &mn, &mx);
if(~mn) {
answer = max(answer, mn - l1);
l1 = mx;
}
l += thr + 1;
}
return max(answer, r - l1);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
