# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
987775 | alextodoran | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 453 ms | 22864 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.
/**
_ _ __ _ _ _ _ _ _
|a ||t ||o d | |o |
| __ _| | _ | __| _ |
| __ |/_ | __ /__\ / _\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 500000;
int N, Q;
int D[N_MAX + 2];
int F[N_MAX + 2];
int get_pos (int t, int i) {
return (t / F[i]) * F[i] - i;
}
int cnt_after (int t, int x) {
int l = -1, r = N;
while (l < r) {
int mid = (l + r + 1) / 2;
if (get_pos(t, mid) >= x) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |