제출 #1255503

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1255503		__ugur__	Fountain (eJOI20_fountain)	C++20	30 / 100	1597 ms	2048 KiB

fountain

#include <iostream>
#include <cstdint>
#include <vector>

using namespace std;

vector<int> diameters;      // D
vector<int> capacities;     // C
vector<int> next_drain;     // next higher, min D (like pointer)

int main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Q;
    cin >> N >> Q;
    diameters = vector<int>(N+1, 0);
    capacities = vector<int>(N+1, 0);
    next_drain = vector<int>(N+1, -1);
    
    {
        int stack[N+2];
        int ptr = 0;
        for(int i=1; i<=N; i++) {
            int d, c;
            cin >> d >> c;
            diameters[i] = d;
            capacities[i] = c;

            i--;
            while(ptr && diameters[stack[ptr-1]] < d)
                next_drain[stack[--ptr]] = i+1;

            if(diameters[i] < d)
                next_drain[i] = i+1;
            else
                stack[ptr++] = i;
            i++;
        }
    }

    while(Q--) {
        int start, vol;
        cin >> start >> vol;
        while(vol > 0 && start >= 0) {
            vol -= capacities[start];
            if(vol > 0)
                start = next_drain[start];
        }
        if(start == -1)
            cout << "0\n";
        else
            cout << start << '\n';
    }
    
    return 0;
}
//6 5 4 10 6 8 3 5 4 14 10 9 4 20 1 25 6 30 5 8 3 13 2 8

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