# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81653 | xiaowuc1 | Gap (APIO16_gap) | C++14 | 111 ms | 6140 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 <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
ll onesolve(int n) {
return 0;
}
ll twosolve(int n) {
ll lhs, rhs;
MinMax(0, 1000000000000000000LL, &lhs, &rhs);
ll ret = (rhs-lhs+n-2)/(n-1);
ll endend = rhs;
// printf("initial guess %lld\n", ret);
set<ll> all;
all.insert(lhs);
all.insert(rhs);
ll last = lhs+1;
while(last <= endend) {
MinMax(last, last + ret, &lhs, &rhs);
// printf("%lld %lld %lld %lld\n", last, last+ret, lhs, rhs);
if(lhs >= 0) {
all.insert(lhs);
all.insert(rhs);
}
last += ret+1;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |