제출 #1126324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1126324		Zbyszek99	Fountain (eJOI20_fountain)	C++20	100 / 100	208 ms	23516 KiB

fountain

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int dim[100002];
int jump[100002][18];
ll val[100002][18];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,q;
    cin >> n >> q;
    rep2(i,1,n)
    {
        cin >> dim[i] >> val[i][0];
    }
    stack<int> s;
    s.push(n+1);
    dim[n+1] = 1e9;
    jump[n+1][0] = n+1;
    for(int i = n; i >= 1; i--)
    {
        while(dim[s.top()] <= dim[i])
        {
            s.pop();
        }
        jump[i][0] = s.top();
        s.push(i);
    }
    rep2(bit,1,17)
    {
        rep2(i,1,n+1)
        {
            jump[i][bit] = jump[jump[i][bit-1]][bit-1];
            val[i][bit] = val[i][bit-1] + val[jump[i][bit-1]][bit-1];
        }
    }
    rep(qq,q)
    {
        int r,v;
        cin >> r >> v;
        for(int bit = 17; bit >= 0; bit--)
        {
            if(v- val[r][bit] > 0)
            {
                v -= val[r][bit];
                r = jump[r][bit];
            }
        }
        if(r == n+1) r = 0;
        cout << r << "\n";
    }
}   

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