oj.uz

Submission #704603

# Submission time Handle Problem Language Result Execution time Memory
704603 2023-03-02T11:55:23 Z thrasherr_1 Fountain (eJOI20_fountain) C++17
30 / 100
 225 ms 31572 KB 
#include <bits/stdc++.h>
using namespace std ;

#define ff first
#define ss second
#define ll long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define ones(x) __builtin_popcount(x)
#define remove(v)  v.erase(unique(all(v)), v.end())
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define per(i, a, b) for(int i = a; i >= b; i--)

#ifdef local
#include "C:\debug.h"
#else
#define dbg(x...) 42
#endif

#define int ll

const int N = 1e5 + 2 ;

int n , q , d[N] , c[N] , up[N][19] , sum[N][19] ;

void dfs(int v , int p) {
    rep(i , 2 , 17) {
        up[v][i] = up[up[v][i - 1]][i - 1] ;
    }
}

void solve(){
    cin >> n >> q ;
    rep(i , 1 , n) {
        cin >> d[i] >> c[i] ;
    }
    stack<pair<int,int>> s ;
    rep(i , 1 , n) {
        sum[i][0] = c[i] ;
        while(sz(s) && s.top().first <= d[i]) {
            up[s.top().second][0] = i ;
            s.pop() ;
        }
        s.push({d[i] , i}) ;
    }
    rep(j , 0 , 18) sum[n + 1][j] = INT_MAX ;
    rep(i , 1 , n) if(!up[i][0]) up[i][1] = n + 1 ;
    per(i , n , 1) {
        rep(j , 1 , 18) {
            up[i][j] = up[up[i][j - 1]][j - 1] ;
            sum[i][j] = sum[i][j - 1] + sum[up[i][j - 1]][j - 1];
        }
    }
    // rep(i , 1 , n) {
        // rep(j , 0 , 18) {
            // cout << sum[i][j] << ' '; 
        // }
        // cout << "\n" ;
    // }
    rep(i , 1 , q) {
        int ind , k ; cin >> ind >> k ;
        per(j , 18 , 0) {
            if(k > sum[ind][j]) {
                k -= sum[ind][j] ;
                ind = up[ind][j] ;
            }
        }
        cout << ind << "\n" ;
    }
    
}

signed main () {
	ios::sync_with_stdio(false) ;
	cin.tie(0) ;
	int test = 1 ;
	// cin >> test ; 
	for(int i = 1 ; i <= test ; i++) {
		solve() ;
	}
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 30868 KB Output is correct
2 Correct 225 ms 31572 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -