제출 #463425

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
463425		gavgav	Fountain (eJOI20_fountain)	C++14	30 / 100	1582 ms	1560 KiB

fountain

#include <iostream>
#include <stack>
using namespace std;
int main(){
    int32_t N, Q, level, volume;
    cin >> N >> Q;
    int32_t capacitys[N], diametrs[N], ng[N] {};
    stack <int32_t> meowmeow;
    for (int i = 0; i < N; i++){
        cin >> diametrs[i] >> capacitys[i];
        while (!meowmeow.empty() && diametrs[meowmeow.top()] < diametrs[i]){
                ng[meowmeow.top()] = i;
                meowmeow.pop();
        }
        meowmeow.push(i);
    }
    for (int32_t i = 0; i < Q; i++){
        cin >> level >> volume;
        level--;
        do{
            if (volume < capacitys[level] + 1){
                level++;
                break;
            }
            volume -= capacitys[level];
            level = ng[level];
        } while (level);
        cout << level << endl;
    }
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40