답안 #657298

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
657298 2022-11-09T13:02:43 Z Banan Fountain (eJOI20_fountain) C++17
30 / 100
1500 ms 3940 KB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int long long
#define double long double
#define endl '\n'
#define sz(a) (int)a.size()
#define pb push_back
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
int const INF = LONG_LONG_MAX;

int n, q, d[200005], c[200005];

void solve()
{
    cin>>n>>q;
    for(int i=1;i<=n;i++)
    {
        cin>>d[i]>>c[i];
    }
    d[n+1]=INF;
    c[n+1]=INF;
    while(q--)
    {
        int r, v;
        cin>>r>>v;
        bool b=1;
        while(v-c[r]>0)
        {
            v-=c[r];
            int k=1;
            while(d[r]>=d[r+k])
            {
                k++;
            }
            r+=k;
            if(r>n){b=0;break;}
        }
        if(b){cout<<r<<endl;}else{cout<<0<<endl;}
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 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 348 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1586 ms 3940 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 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 348 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Execution timed out 1586 ms 3940 KB Time limit exceeded
9 Halted 0 ms 0 KB -