# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463430 | gavgav | Fountain (eJOI20_fountain) | C++17 | 1583 ms | 1300 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <stack>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
uint32_t N, Q, level, volume;
cin >> N >> Q;
uint32_t diametrs[N], ng[N] {};
uint16_t capacitys[N];
stack <uint32_t> meowmeow;
for (uint32_t 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 (uint32_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;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |