oj.uz

답안 #840774

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840774 2023-08-31T16:55:11 Z Andrijanikolic73 Fountain (eJOI20_fountain) C++17
30 / 100
 1500 ms 5360 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
    int n,q;
    cin>>n>>q;
    int koliko[n+1];
    int staje[n+1];
    for(int i=1;i<=n;i++)cin>>koliko[i]>>staje[i];
    while(q--){
        int r,k;
        cin>>r>>k;
        vector<int>R;
        int z=r;
        R.push_back(r);
        for(int i=z;i<n;i=z){
            //cout<<i<<" ";
            int ok=0;
            for(int j=i+1;j<=n;j++){
                if(koliko[i]<koliko[j]){
                    ok=1;
                    z=j;
                    R.push_back(j);
                    break;
                }
            }
            if(!ok)break;
        }
        int ans=0;
        for(auto it:R){
            k-=staje[it];
            if(k<=0){
                ans=it;
                break;
            }
        }
        cout<<ans;
        cout<<endl;
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 6 ms 464 KB Output is correct
7 Correct 4 ms 340 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1558 ms 5360 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 6 ms 464 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Execution timed out 1558 ms 5360 KB Time limit exceeded
9 Halted 0 ms 0 KB -