oj.uz

Submission #707589

# Submission time Handle Problem Language Result Execution time Memory
707589 2023-03-09T12:23:28 Z dooompy Worst Reporter 3 (JOI18_worst_reporter3) C++17
12 / 100
 539 ms 31132 KB 
#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

ll d[500005];

ll movedist[500005];
ll period[500005];


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n, q; cin >> n >> q;
    movedist[0] = 1;
    period[0] = 1;

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

        // how many the prev one moes

        if (movedist[i - 1] >= d[i]) {
            movedist[i] = movedist[i - 1];
            period[i] = period[i - 1];
        } else {
            ll towait = ceil((double) (d[i]) / (double) movedist[i - 1]);

            movedist[i] = towait * movedist[ i- 1];
            period[i] = towait * period [i - 1];
        }
    }



    for (int i = 1; i <= q; i++) {
        ll l, r, t; cin >> t >> l >> r;

        ll L = 0, R = n;

        ll ans = -1;

        while (L <= R) {
            ll mid = ( L + R) >> 1;
            if (-mid + (t / period[mid]) * movedist[mid] >= l) {
                ans = max(ans, mid);
                L = mid + 1;
            } else R = mid - 1;
        }

        if (ans == -1) {
            cout << "0\n";
            continue;
        }

        ll ans2 = LLONG_MAX;
        L = 0, R = n;
        while (L <= R) {
            ll mid = ( L + R) >> 1;
            if (-mid + (t / period[mid]) * movedist[mid] <= r) {
                ans2 = min(ans2, mid);
                R = mid - 1;
            } else L = mid + 1;
        }

        if (ans2 == LLONG_MAX) {
            cout << "0\n";
        }

        cout << ans - ans2 + 1 << "\n";
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 539 ms 31132 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 81.0

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