| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1179979 | vladkonoval | Fountain (eJOI20_fountain) | C++20 | 43 ms | 3396 KiB |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;
ll n,q,i,r[100007],v[100007],dp[100007],id,v1,res,cur;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>q;
for (i=1;i<=n;i++) cin>>r[i]>>v[i];
for (i=1;i<=n;i++) dp[i] = dp[i-1] + v[i];
while (q--) {
cin>>id>>v1;
v1+=dp[id-1];
auto it = lower_bound(dp+1,dp+1+n,v1)-dp;
if (it>n) cout<<0<<endl;
else
cout<<it<<endl;
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
