oj.uz

Submission #704528

# Submission time Handle Problem Language Result Execution time Memory
704528 2023-03-02T09:01:35 Z thrasherr_1 Fountain (eJOI20_fountain) C++17
30 / 100
 1500 ms 5864 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] , pr[N] ;

int up(int v , int cp) {
    if(v > n) return 0 ;
    cp -= c[v] ;
    if(cp <= 0) return v ;
    return up(pr[v] , cp) ;
}

void solve(){
    cin >> n >> q ;
    rep(i , 1 , n) {
        cin >> d[i] >> c[i] ;
    }
    stack<pair<int,int>> s ;
    s.push({LLONG_MAX , n + 1}) ;
    per(i , n , 1){
        while(sz(s) && s.top().first <= d[i]) s.pop() ;
        pr[i] = s.top().second ;
        s.push({d[i] , i}) ;
    }
    rep(i , 1 , q) {
        int f , l ; cin >> f >> l ;
        int last = up(f , l) ;
        if(last > n) last = 0 ;
        cout << last << "\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
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1570 ms 5864 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Execution timed out 1570 ms 5864 KB Time limit exceeded
9 Halted 0 ms 0 KB -