oj.uz

Submission #576538

# Submission time Handle Problem Language Result Execution time Memory
576538 2022-06-13T07:25:20 Z MuntherCarrot Fountain (eJOI20_fountain) C++14
30 / 100
 77 ms 2520 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define all(x) x.begin(),x.end()
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,q;
    cin >> n >> q;
    vector<ll> d(n+1,0),c(n+1,0);
    for(int i=1;i<=n;i++) cin >> d[i] >> c[i];
    for(int i=1;i<n+1;i++) c[i]+=c[i-1];
    while(q--){
        int r,v;
        cin >> r >> v;
        v+=c[r-1];
        int ans=lower_bound(c.begin()+1,c.end(),v)-c.begin();
        cout << (ans > n ? 0:ans) << endl;
    }
    return 0;
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 60 ms 2520 KB Output is correct
2 Correct 77 ms 2500 KB Output is correct

Subtask #3
0 / 40.0

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