| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 343164 | jjwdi0 | Gap (APIO16_gap) | C++11 | 67 ms | 3484 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>
using namespace std;
using ll = long long;
ll solve1(int N) {
int x = (N + 1) / 2;
vector<ll> v;
ll s = 0, e = 1e18, mn, mx;
for(int i=0; i<x; i++) {
MinMax(s, e, &mn, &mx);
v.push_back(mn);
if(mn != mx) v.push_back(mx);
s = mn + 1, e = mx - 1;
}
sort(v.begin(), v.end());
ll ans = 0;
for(int i=1; i<N; i++) {
ans = max(ans, v[i] - v[i-1]);
}
return ans;
}
ll solve2(int N) {
ll s = 0, e = 1e18, mn, mx;
MinMax(s, e, &mn, &mx);
s = mn, e = mx;
ll T = (e - s + N - 2) / (N - 1);
vector<ll> v;
ll l = s, r = s + T;
for(int i=1; i<N; i++) {
MinMax(l, r, &mn, &mx);
if(mn != -1) v.push_back(mn), v.push_back(mx);
l += T + 1, r += T + 1;
}
ll ans = 0;
for(int i=1; i<v.size(); i++) {
ans = max(ans, v[i] - v[i-1]);
}
return ans;
}
ll findGap(int T, int N) {
if(T == 1) return solve1(N);
return solve2(N);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
