# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94166 | autumn_eel | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 1109 ms | 29304 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 rep(i,n)for(int i=0;i<(n);i++)
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int n;
ll d[600000];
ll a[600000];//cycle
int calc(ll x,ll T){
ll l=-1,r=n+1;
while(r-l>1){
int t=(l+r)/2;
if(-t+(T/a[t])*a[t]>=x)l=t;
else r=t;
}
return r;
}
int main(){
int q;scanf("%d%d",&n,&q);
rep(i,n)scanf("%lld",&d[i+1]);
a[0]=1;
for(int i=1;i<=n;i++){
ll t=(d[i]+a[i-1]-1)/a[i-1];
a[i]=t*a[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... |