oj.uz

Submission #827850

# Submission time Handle Problem Language Result Execution time Memory
827850 2023-08-16T20:18:05 Z ayankarimova Fountain (eJOI20_fountain) C++14
30 / 100
 124 ms 16444 KB 
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const ll sz=100005;
ll l[sz], s[sz], ss[sz];
set<ll>st;
map<ll, ll>mp;
int main(){

    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll n, q;
    cin>>n>>q;
    for(int i=1; i<=n; i++){
        cin>>l[i]>>s[i];
        ss[i]=ss[i-1]+s[i];
        st.insert(ss[i]);
        mp[ss[i]]=i;
    }
    while(q--){
        ll in, k;
        cin>>in>>k;
        ll f=ss[in-1]+k;
        auto it=st.lower_bound(f);
        if(it==st.end()){
            cout<<0<<endl;
        }
        else{
            cout<<mp[*it]<<endl;
        }
    }
}

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 111 ms 16444 KB Output is correct
2 Correct 124 ms 15832 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 -