oj.uz

Submission #772761

# Submission time Handle Problem Language Result Execution time Memory
772761 2023-07-04T10:59:17 Z BlockOG Fountain (eJOI20_fountain) C++14
100 / 100
 432 ms 18264 KB 
#include <iostream>

using namespace std;

int diameters[100000];
int down[100000][20];
int sum[100000][20];

int st[100001][2];
int sp = 1;

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

    st[0][0] = 1000000001;
    st[0][1] = -1;

    int n, q; cin >> n >> q;
    for (int i = 0; i < n; i++) cin >> diameters[i] >> sum[i][0];

    for (int i = n - 1; i >= 0; i--) {
        while (st[sp - 1][0] <= diameters[i]) sp--;
        down[i][0] = st[sp - 1][1];
        st[sp][0] = diameters[i];
        st[sp++][1] = i;
    }

    for (int j = 1; j < 20; j++) {
        for (int i = 0; i < n; i++) {
            if (down[i][j - 1] == -1) {
                down[i][j] = -1;
                sum[i][j] = sum[i][j - 1];
                continue;
            }
            down[i][j] = down[down[i][j - 1]][j - 1];
            sum[i][j] = sum[i][j - 1] + sum[down[i][j - 1]][j - 1];
        }
    }

    for (int it = 0; it < q; it++) {
        int r, v; cin >> r >> v; r--;

        for (int i = 19; i >= 0; i--) {
            if (sum[r][i] >= v) continue;
            v -= sum[r][i];
            r = down[r][i];
            if (r == -1) break;
        }

        cout << r + 1 << endl;
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 17068 KB Output is correct
2 Correct 266 ms 15820 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 300 ms 17068 KB Output is correct
9 Correct 266 ms 15820 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 147 ms 9772 KB Output is correct
12 Correct 432 ms 18264 KB Output is correct
13 Correct 326 ms 17684 KB Output is correct
14 Correct 280 ms 17524 KB Output is correct
15 Correct 288 ms 17484 KB Output is correct