oj.uz

Submission #528809

# Submission time Handle Problem Language Result Execution time Memory
528809 2022-02-21T13:40:02 Z Lobo Worst Reporter 3 (JOI18_worst_reporter3) C++17
12 / 100
 505 ms 21752 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 510000

int n, q, d[maxn];

void solve() {
    cin >> n >> q;

    for(int i = 1; i <= n; i++) {
        cin >> d[i];
    }

    for(int i = 2; i <= n; i++) {
        d[i] = d[i-1]*((d[i]+d[i-1]-1)/d[i-1]);
    }

    while(q--) {
        int t,l,r;
        cin >> t >> l >> r;

        int l1 = 1;
        int r1 = n;
        int ans1 = 0;
        //pos[i] >= pos[i-1]
        //encontrar o menor i que tem pos <= r
        while(l1 <= r1) {
            int mid = (l1+r1)/2;

            int pos = -mid+(t/d[mid])*d[mid];

            if(pos <= r) {
                ans1 = mid;
                r1 = mid-1;
            }
            else {
                l1 = mid+1;
            }
        }

        int l2 = 1;
        int r2 = n;
        int ans2 = 0;
        //pos[i] >= pos[i-1]
        //encontrar o maior i que tem pos[i] >= l
        while(l2 <= r2) {
            int mid = (l2+r2)/2;

            int pos = -mid+(t/d[mid])*d[mid];

            if(pos >= l) {
                ans2 = mid;
                l2 = mid+1;
            }
            else {
                r2 = mid-1;
            }
        }

        int ans = max(0LL,ans2-ans1+1);
        if(l <= t && t <= r) ans++;

        cout << ans << endl;
    }
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 505 ms 21752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 81.0

# Verdict Execution time Memory Grader output
1 Incorrect 505 ms 21752 KB Output isn't correct
2 Halted 0 ms 0 KB -