# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
281733 | 2020-08-23T11:50:09 Z | MKopchev | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 953 ms | 27408 KB |
#include<bits/stdc++.h> using namespace std; const int nmax=5e5+42,inf=1e9+42; int n,q; int inp[nmax]; long long help[nmax]; int score(int i,int t) { return (t/help[i])*help[i]-i; } int last_valid(int pos,int t) { int ok=n+1,not_ok=-1; while(ok-not_ok>1) { int av=(ok+not_ok)/2; if(score(av,t)<=pos)ok=av; else not_ok=av; } //cout<<"last "<<ok<<endl; return ok; } int first_valid(int pos,int t) { int ok=-1,not_ok=n+1; while(not_ok-ok>1) { int av=(ok+not_ok)/2; if(score(av,t)>=pos)ok=av; else not_ok=av; } //cout<<"first "<<ok<<endl; return ok; } int main() { scanf("%i%i",&n,&q); for(int i=1;i<=n;i++) { scanf("%i",&inp[i]); } inp[0]=1; help[0]=1; for(int i=1;i<=n;i++) { help[i]=help[i-1]*((inp[i]+help[i-1]-1)/help[i-1]); if(help[i]>inf)help[i]=inf; //cout<<i<<" -> "<<help[i]<<endl; } for(int i=1;i<=q;i++) { int l,r,t; scanf("%i%i%i",&t,&l,&r); /* for(int j=0;j<=n;j++) cout<<j<<" -> "<<score(j,t)<<endl; */ printf("%i\n",first_valid(l,t)-last_valid(r,t)+1); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 884 ms | 24728 KB | Output is correct |
2 | Correct | 933 ms | 24696 KB | Output is correct |
3 | Correct | 946 ms | 24696 KB | Output is correct |
4 | Correct | 953 ms | 24824 KB | Output is correct |
5 | Correct | 890 ms | 24704 KB | Output is correct |
6 | Correct | 942 ms | 24728 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 2 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 884 ms | 24728 KB | Output is correct |
2 | Correct | 933 ms | 24696 KB | Output is correct |
3 | Correct | 946 ms | 24696 KB | Output is correct |
4 | Correct | 953 ms | 24824 KB | Output is correct |
5 | Correct | 890 ms | 24704 KB | Output is correct |
6 | Correct | 942 ms | 24728 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 384 KB | Output is correct |
9 | Correct | 2 ms | 384 KB | Output is correct |
10 | Correct | 2 ms | 384 KB | Output is correct |
11 | Correct | 1 ms | 384 KB | Output is correct |
12 | Correct | 1 ms | 384 KB | Output is correct |
13 | Correct | 561 ms | 23220 KB | Output is correct |
14 | Correct | 580 ms | 24164 KB | Output is correct |
15 | Correct | 556 ms | 22524 KB | Output is correct |
16 | Correct | 552 ms | 23036 KB | Output is correct |
17 | Correct | 643 ms | 27256 KB | Output is correct |
18 | Correct | 677 ms | 27256 KB | Output is correct |
19 | Correct | 635 ms | 27296 KB | Output is correct |
20 | Correct | 659 ms | 27256 KB | Output is correct |
21 | Correct | 667 ms | 27384 KB | Output is correct |
22 | Correct | 724 ms | 27384 KB | Output is correct |
23 | Correct | 673 ms | 27408 KB | Output is correct |
24 | Correct | 646 ms | 27384 KB | Output is correct |
25 | Correct | 900 ms | 24700 KB | Output is correct |
26 | Correct | 896 ms | 24824 KB | Output is correct |
27 | Correct | 700 ms | 26848 KB | Output is correct |
28 | Correct | 692 ms | 27180 KB | Output is correct |
29 | Correct | 676 ms | 26744 KB | Output is correct |
30 | Correct | 752 ms | 26848 KB | Output is correct |
31 | Correct | 714 ms | 27004 KB | Output is correct |
32 | Correct | 707 ms | 23480 KB | Output is correct |
33 | Correct | 1 ms | 384 KB | Output is correct |