oj.uz

Submission #44709

# Submission time Handle Problem Language Result Execution time Memory
44709 2018-04-05T10:56:20 Z top34051 Worst Reporter 3 (JOI18_worst_reporter3) C++17
100 / 100
 1131 ms 7644 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
const int maxn = 5e5 + 5;

int n,q;
ll dist[maxn];

int get(ll T, ll L) {
    int l = 0, r = n, mid, pos = -1;
    while(l<=r) {
        mid = (l+r)/2;
        if(L <= -mid + (T/dist[mid])*dist[mid]) {
            pos = mid;
            l = mid+1;
        }
        else r = mid-1;
    }
    return pos;
}

int main() {
    scanf("%d%d",&n,&q);
    dist[0] = 1;
    for(int i=1;i<=n;i++) {
        scanf("%lld",&dist[i]);
        dist[i] = (ll)ceil((double)dist[i]/dist[i-1]) * dist[i-1];
    }
    while(q--) {
        ll T, L, R; int res = 0;
        scanf("%lld%lld%lld",&T,&L,&R);
//        printf("\t");
//        for(int i=1;i<=n;i++) printf("%lld ",-i+(T/dist[i])*dist[i]);
//        printf("\n");
        printf("%d\n",get(T,L) - get(T,R+1));
    }
}

Compilation message

worst_reporter3.cpp: In function 'int main()':
worst_reporter3.cpp:31:25: warning: unused variable 'res' [-Wunused-variable]
         ll T, L, R; int res = 0;
                         ^~~
worst_reporter3.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&q);
     ~~~~~^~~~~~~~~~~~~~
worst_reporter3.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&dist[i]);
         ~~~~~^~~~~~~~~~~~~~~~~
worst_reporter3.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld",&T,&L,&R);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1131 ms 7300 KB Output is correct
2 Correct 1074 ms 7572 KB Output is correct
3 Correct 1098 ms 7572 KB Output is correct
4 Correct 1058 ms 7572 KB Output is correct
5 Correct 1058 ms 7572 KB Output is correct
6 Correct 1067 ms 7572 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7572 KB Output is correct
2 Correct 3 ms 7572 KB Output is correct
3 Correct 3 ms 7572 KB Output is correct
4 Correct 3 ms 7572 KB Output is correct
5 Correct 4 ms 7572 KB Output is correct
6 Correct 3 ms 7572 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 1131 ms 7300 KB Output is correct
2 Correct 1074 ms 7572 KB Output is correct
3 Correct 1098 ms 7572 KB Output is correct
4 Correct 1058 ms 7572 KB Output is correct
5 Correct 1058 ms 7572 KB Output is correct
6 Correct 1067 ms 7572 KB Output is correct
7 Correct 3 ms 7572 KB Output is correct
8 Correct 3 ms 7572 KB Output is correct
9 Correct 3 ms 7572 KB Output is correct
10 Correct 3 ms 7572 KB Output is correct
11 Correct 4 ms 7572 KB Output is correct
12 Correct 3 ms 7572 KB Output is correct
13 Correct 671 ms 7572 KB Output is correct
14 Correct 652 ms 7572 KB Output is correct
15 Correct 667 ms 7572 KB Output is correct
16 Correct 645 ms 7572 KB Output is correct
17 Correct 804 ms 7572 KB Output is correct
18 Correct 847 ms 7572 KB Output is correct
19 Correct 809 ms 7572 KB Output is correct
20 Correct 824 ms 7572 KB Output is correct
21 Correct 845 ms 7572 KB Output is correct
22 Correct 811 ms 7572 KB Output is correct
23 Correct 837 ms 7572 KB Output is correct
24 Correct 835 ms 7572 KB Output is correct
25 Correct 1062 ms 7596 KB Output is correct
26 Correct 1054 ms 7616 KB Output is correct
27 Correct 908 ms 7616 KB Output is correct
28 Correct 879 ms 7616 KB Output is correct
29 Correct 851 ms 7616 KB Output is correct
30 Correct 891 ms 7644 KB Output is correct
31 Correct 866 ms 7644 KB Output is correct
32 Correct 811 ms 7644 KB Output is correct
33 Correct 2 ms 7644 KB Output is correct