oj.uz

Submission #1008545

# Submission time Handle Problem Language Result Execution time Memory
1008545 2024-06-26T14:15:32 Z toast12 Fountain (eJOI20_fountain) C++14
30 / 100
 1500 ms 1372 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int n, q;
    cin >> n >> q;
    vector<int> d(n+1), c(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> d[i] >> c[i];
    }
    while (q--) {
        int r, v;
        cin >> r >> v;
        int ans = 0;
        int cur = v;
        int prev = INT_MIN;
        for (int i = r; i <= n; i++) {
            if (d[i] <= prev)
                continue;
            if (cur <= c[i]) {
                ans = i;
                break;
            }
            else {
                cur -= c[i];
            }
            prev = d[i];
        }
        cout << ans << '\n';
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 472 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1538 ms 1372 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Execution timed out 1538 ms 1372 KB Time limit exceeded
9 Halted 0 ms 0 KB -