oj.uz

답안 #844746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
844746 2023-09-05T19:32:19 Z HaciyevAlik Fountain (eJOI20_fountain) C++14
30 / 100
 58 ms 6224 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//I Sawed the Demons
using ll = long long;
using ld = long double;
using ordered_set = tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>;
#define pb push_back
#define oo 1000000000000000000
#define ff first
#define ss second

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);    
   	ll n,q; cin >> n >> q;
   	vector<ll> d(n+1),c(n+1),pre(n+1);
   	for(int i=1;i<=n;++i) {
   		cin >> d[i] >> c[i];
   	}
   	pre[0]=0;
   	for(int i=1;i<=n;++i) {
   		pre[i]=pre[i-1]+c[i];
   	}
   	while(q--) {
   		ll r,v; cin >> r >> v;
   		if(v<=c[r]) {
   			cout << r << "\n"; continue;
   		}
   		v+=pre[r-1];
   		if(v>pre[n]) {
   			cout << "0\n"; continue;
   		}
   		auto it=(--upper_bound(pre.begin(),pre.end(),v));
   		if(*it == v) {
   			cout << it-pre.begin();
   		} else {
   			cout << it-pre.begin()+1;
   		}
   		cout << "\n";
   	}
    return 0;
}

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 3344 KB Output is correct
2 Correct 58 ms 6224 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -