# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
877987 | phong | Sure Bet (CEOI17_sure) | C++17 | 1 ms | 2396 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>
#define int long long
using ll = long long;
const int nmax = 1e6 + 5;
const int lg = 20;
const int mod = 1e9 + 7;
const ll oo = 1e18;
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;
int n, q, t;
double a[nmax], b[nmax];
bool check(int k){
for(int i = 0; i <= n; ++i){
int l = 0, r = n, it1 = -1, it2 = -1;
while(l <= r){
int mid = r + l >> 1;
if(a[i] - i - mid >= k){
it1 = mid;
l = mid + 1;
}
else r = mid - 1;
}
if(it1 != -1){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |