#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n, q, vol, pos; cin >> n >> q;
vector < pair < int, int > > v(n);
for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
vector < int > pour(n);
stack < int > st;
for (int i = n - 1; i >= 0; i--)
{
while (!st.empty() and v[st.top()] <= v[i]) st.pop();
pour[i] = (st.empty() ? -1 : st.top());
st.push(i);
}
for (int i = 0; i < q; i++)
{
cin >> pos >> vol; pos--;
while (pos != -1)
{
vol -= v[pos].second;
if (vol <= 0) break;
pos = pour[pos];
}
cout << pos + 1 << '\n';
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1579 ms |
3668 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |