oj.uz

Submission #389836

# Submission time Handle Problem Language Result Execution time Memory
389836 2021-04-14T15:34:38 Z Alma Fountain (eJOI20_fountain) C++14
30 / 100
 82 ms 4492 KB 
#include <bits/stdc++.h>
using namespace std;

int f (int p, int n, vector<int> & s, int l) {
    
    int x = s[p-1];
    int lo = p, mid, hi = n, res = 0;
    
    while (lo <= hi) {
        mid = lo + (hi-lo) / 2;
        if (s[mid] - x - l >= 0) {
            hi = mid-1;
            res = mid;
        } else {
            lo = mid+1;
        }
    }
    return res;
}

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

    int n, q, a, b, p, l, sum = 0;
    cin >> n >> q;
    vector<int> s(n+1);
    s[0] = 0;
    
    for (int i = 1; i <= n; i++) {
        cin >> a >> b;
        sum += b;
        s[i] = sum;
    }
    while (q--) {
        cin >> p >> l;
        cout << f(p, n, s, l) << '\n';
    }
    return 0;
}

Subtask #1
0 / 30.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 4392 KB Output is correct
2 Correct 82 ms 4492 KB Output is correct

Subtask #3
0 / 40.0

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