oj.uz

Submission #203267

# Submission time Handle Problem Language Result Execution time Memory
203267 2020-02-20T02:27:36 Z tri Worst Reporter 3 (JOI18_worst_reporter3) C++14
100 / 100
 1732 ms 29560 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

const int MAXN = 5e5 + 10;
ll d[MAXN], c[MAXN];

int N, Q;

ll fPos(int i, ll t) {
    ll step = t / c[i];
    return -i + step * c[i];
}

// returns number of people with position >= lBound
ll searchAfter(ll lBound, ll t) {
    int low = 0;
    int hi = N + 1;

    while (low != hi) {
        int mid = (low + hi + 1) / 2;

        if (fPos(mid - 1, t) >= lBound) { // implies that 0...mid-2 works too as earlier is greater
            assert(low != mid);
            low = mid;
        } else {
            hi = mid - 1;
        }
    }
    return low;
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> N >> Q;

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

    for (int i = 1; i <= N; i++) {
        ll step = (d[i] + c[i - 1] - 1) / c[i - 1];
        c[i] = step * c[i - 1];
    }

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

        ll lCnt = searchAfter(l, t);
        ll rCnt = searchAfter(r + 1, t);

        ll cnt = lCnt - rCnt;
        cout << cnt << endl;
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1694 ms 13176 KB Output is correct
2 Correct 1714 ms 26752 KB Output is correct
3 Correct 1713 ms 26756 KB Output is correct
4 Correct 1732 ms 26852 KB Output is correct
5 Correct 1706 ms 27000 KB Output is correct
6 Correct 1706 ms 26920 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 1694 ms 13176 KB Output is correct
2 Correct 1714 ms 26752 KB Output is correct
3 Correct 1713 ms 26756 KB Output is correct
4 Correct 1732 ms 26852 KB Output is correct
5 Correct 1706 ms 27000 KB Output is correct
6 Correct 1706 ms 26920 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 8 ms 376 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 1416 ms 25328 KB Output is correct
14 Correct 1439 ms 25896 KB Output is correct
15 Correct 1442 ms 24580 KB Output is correct
16 Correct 1408 ms 24952 KB Output is correct
17 Correct 1534 ms 29432 KB Output is correct
18 Correct 1554 ms 29312 KB Output is correct
19 Correct 1528 ms 29476 KB Output is correct
20 Correct 1545 ms 29264 KB Output is correct
21 Correct 1562 ms 29432 KB Output is correct
22 Correct 1551 ms 29560 KB Output is correct
23 Correct 1521 ms 29176 KB Output is correct
24 Correct 1529 ms 29472 KB Output is correct
25 Correct 1707 ms 26836 KB Output is correct
26 Correct 1706 ms 26872 KB Output is correct
27 Correct 1598 ms 28920 KB Output is correct
28 Correct 1595 ms 29304 KB Output is correct
29 Correct 1594 ms 28840 KB Output is correct
30 Correct 1617 ms 28876 KB Output is correct
31 Correct 1603 ms 29176 KB Output is correct
32 Correct 1553 ms 25452 KB Output is correct
33 Correct 5 ms 376 KB Output is correct