# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
535795 | 79brue | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 754 ms | 33300 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;
typedef long long ll;
int n, q;
ll arr[500002];
ll ta[500002], len[500002];
int calc(ll t, ll x){
int l = 0, r = n, ans = -1;
while(l <= r){
int m = (l+r)>>1;
if((t / ta[m]) * len[m] - m >= x){
ans = m;
l = m+1;
}
else r = m-1;
}
return ans;
}
int main(){
scanf("%d %d", &n, &q);
for(int i=1; i<=n; i++) scanf("%lld", &arr[i]);
ta[0] = 1, len[0] = 1;
for(int i=1; i<=n; i++){
ta[i] = ta[i-1] * ((arr[i] + len[i-1] - 1) / len[i-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... |