oj.uz

Submission #690802

# Submission time Handle Problem Language Result Execution time Memory
690802 2023-01-30T12:24:27 Z ismayil Fountain (eJOI20_fountain) C++17
30 / 100
 252 ms 8428 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, q;
    cin>>n>>q;
    ll D[n], C[n], R[q], V[q], pref[n + 1];
    for (int i = 0; i < n; i++) cin>>D[i]>>C[i];
    
    for (int i = 0; i < n; i++) pref[i + 1] = pref[i] + C[i];
    for (int i = 0; i < q; i++)
    {
        cin>>R[i]>>V[i];
        cout<<lower_bound(pref, pref + n + 1, pref[R[i] - 1] + V[i]) - pref<<endl;
    }
    
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 206 ms 8136 KB Output is correct
2 Correct 252 ms 8428 KB Output is correct

Subtask #3
0 / 40.0

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