제출 #446089

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
446089		Ronin13	Fountain (eJOI20_fountain)	C++14	0 / 100	103 ms	15356 KiB

fountain

#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ull unsigned ll
#define epb emplace_back
#define pb push_back
#define inf 1e9+1
#define linf 1e18+1
using namespace std;

void solve(){
    int n;cin>>n;
    int q;cin>>q;
    ll c[n+1],d[n+1];
    for(int i=1;i<=n;i++){
        cin>>d[i]>>c[i];
    }
    stack<ll>st;
    st.push(n);
    int next[n+2][22];
    next[n][0]=n+1;
    next[n+1][0]=n+1;
    int par[n+2];
    for(int i=1;i<=n+1;i++){
        for(int j=1;j<=21;j++)next[i][j]=n+1,par[i]=0;
    }
    ll pref[n+2];
    pref[0]=0;
    pref[n+1]=linf;

    for(int i=n-1;i>=1;i--){
        while(true){
            if(st.empty())break;
            int ind=st.top();
            if(d[ind]>d[i]){
                next[i][0]=ind;
                par[ind]=i;
                break;
            }
            else st.pop();
        }
        if(st.empty()){
            next[i][0]=n+1;
        }
        st.push(i);
    }

    for(int i=1;i<=n;i++){
        pref[i]=pref[par[i]]+c[i];
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=21;j++){
            next[i][j]=next[next[i][j-1]][j-1];
        }
    }

    while(q--){
        int ves;ll l;
        cin>>ves>>l;
        l+=pref[par[ves]];
        if(l<=pref[ves]){
            cout<<ves<<"\n";
            continue;
        }
        int cur=ves;
        for(int i=21;i>=0;i--){
            int nex=next[cur][i];
            if(pref[nex]<l)cur=nex;
        }
        cout<<next[cur][0]%(n+1)<<"\n";
    }
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    solve();
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40