oj.uz

답안 #388722

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388722 2021-04-12T16:50:34 Z Iwanttobreakfree Fountain (eJOI20_fountain) C++17
30 / 100
 1500 ms 5168 KB 
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
    int n,q,li,num;
    cin>>n>>q;
    int men=1e9;
    vector<pair<int,int> >fuen(n);
    vector<vector<int> >cone(n,vector<int>());
    set<int> s;
    set<int>borrar;
    for(int i=0;i<n;i++){
        cin>>fuen[i].second>>fuen[i].first;
        if(fuen[i].second<=men){
            men=fuen[i].second;
            s.insert(i);
        }
        else{
        s.insert(i);
            for(auto it=s.begin();it!=s.end();it++){
            //cout<<*it<<' ';
                if(fuen[*it].second<fuen[i].second){
                    cone[*it].push_back(i);
                    //cout<<*it<<' '<<i<<' ';
                    borrar.insert(*it);
                }
            }
            for(int x:borrar)s.erase(x);
            //cout<<'\n';
        }
    }
    bool sol=true;
    while(q--){
        cin>>num>>li;
        num--;
        sol=true;
        while(true){
        //cout<<num<<' '<<li<<' ';
        li-=fuen[num].first;
        if(li<1)break;
            if(cone[num].empty()){
                sol=false;
                break;
            }
            else{
                for(int x:cone[num]){
                    num=x;
                }
            }
        }
        if(!sol)cout<<0<<'\n';
        else cout<<num+1<<'\n';
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 356 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 11 ms 396 KB Output is correct
5 Correct 13 ms 440 KB Output is correct
6 Correct 16 ms 460 KB Output is correct
7 Correct 12 ms 332 KB Output is correct

Subtask #2
0 / 30.0

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

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 356 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 11 ms 396 KB Output is correct
5 Correct 13 ms 440 KB Output is correct
6 Correct 16 ms 460 KB Output is correct
7 Correct 12 ms 332 KB Output is correct
8 Execution timed out 1573 ms 5168 KB Time limit exceeded
9 Halted 0 ms 0 KB -