oj.uz

Submission #576658

# Submission time Handle Problem Language Result Execution time Memory
576658 2022-06-13T08:58:04 Z Jassar Fountain (eJOI20_fountain) C++14
0 / 100
 1500 ms 3776 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;


int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	ll n,q;
	cin >> n >> q;
	vector<pair<ll , ll>> v;
	stack<ll> s;
	ll p[n];
	for (ll i=0; n>i; i++)
    {
        p[i] = 0;
    }
	for (ll i=0; n>i; i++)
    {
        ll a,b;
        cin >> a >> b;
        v.push_back({a , b});
    }
    for (ll i=n-1; i>=0; i--)
    {
        while (!s.empty() && v[i].first > v[s.top()].first)
        {
            s.pop();
        }
        if (s.empty())
        {
            p[i] = -1;
        }
        else
        {
            p[i] = s.top();
        }
        s.push(i);
    }
    while (q--)
    {
        ll a,b;
        cin >> a >> b;
        a--;
        ll i=a;
        while(b > 0)
        {
            b -= v[i].second;
            if (b <= 0)
            {
                cout << i + 1 << endl;
                i = -1;
                break;
            }
            i = p[i];
            if (i == n - 1)
            {
                cout << 0 << endl;
                break;
            }
        }
    }
	return 0;
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1559 ms 3776 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -