# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602834 | elkernos | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 573 ms | 29252 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>
using namespace std;
#define int long long
int32_t main()
{
cin.tie(0)->sync_with_stdio(0);
int n, q;
cin >> n >> q;
vector<int> d(n + 1), f(n + 1);
for(int i = 1; i <= n; i++) {
cin >> d[i];
if(i == 1) {
f[i] = d[i];
}
else {
f[i] = (d[i] + f[i - 1] - 1) / f[i - 1] * f[i - 1];
}
}
auto licz = [&](int t, int x) {
int lo = 1, hi = n, ans = 0;
while(lo <= hi) {
int mid = (lo + hi) / 2;
if(t / f[mid] * f[mid] - mid >= x) {
lo = mid + 1;
ans = mid;
}
else {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |