oj.uz

Submission #692201

# Submission time Handle Problem Language Result Execution time Memory
692201 2023-02-01T08:16:20 Z vjudge1 Fountain (eJOI20_fountain) C++17
100 / 100
 774 ms 31888 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll sz = 1e5 + 5, lg = 17;
ll up[lg][sz], par[sz], pref[sz];
pp(ll, ll) a[sz];
vv(ll) g[sz];
void dfs(ll v, ll pr = 0)
{
    par[v] = pr;
    pref[v] = pref[pr] + a[v].S;
    for (ll to : g[v])
        if (to != pr)
            dfs(to, v);
}
ll sum(ll l, ll r)
{
    return pref[r] - pref[par[l]];
}
void solve()
{
    ll n, q;
    cin >> n >> q;
    for (ll i = 1; i <= n; i++)
        cin >> a[i].F >> a[i].S;
    a[n + 1].F = 1e10;
    a[n + 1].S = 1e9;
    stack<pp(ll, ll)> s;
    s.push(mpr(a[n + 1].F, n + 1));
    for (ll i = n; i >= 1; i--)
    {
        while (s.top().F <= a[i].F)
            s.pop();
        g[s.top().S].pb(i);
        g[i].pb(s.top().S);
        s.push(mpr(a[i].F, i));
    }
    dfs(n + 1);
    for (ll i = 1; i <= n; i++)
        up[0][i] = par[i];
    for (ll i = 0; i < lg; i++)
        up[i][n + 1] = n + 1;
    for (ll bit = 1; bit < lg; bit++)
        for (ll i = 1; i <= n; i++)
            up[bit][i] = up[bit - 1][up[bit - 1][i]];
    while (q--)
    {
        ll x, s;
        cin >> x >> s;
        ll l = 0, r = n, ans = n + 1;
        while (l <= r)
        {
            ll mid = (l + r) >> 1, k = x;
            for (ll i = lg - 1; i >= 0; i--)
                if (mid >> i & 1)
                    k = up[i][k];
            if (sum(k, x) >= s)
                r = mid - 1, ans = k;
            else
                l = mid + 1;
        }
        cout << (ans == n + 1 ? 0 : ans) << endl;
    }
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2900 KB Output is correct
3 Correct 3 ms 2956 KB Output is correct
4 Correct 3 ms 2948 KB Output is correct
5 Correct 4 ms 3028 KB Output is correct
6 Correct 3 ms 2948 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 29180 KB Output is correct
2 Correct 488 ms 27612 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2900 KB Output is correct
3 Correct 3 ms 2956 KB Output is correct
4 Correct 3 ms 2948 KB Output is correct
5 Correct 4 ms 3028 KB Output is correct
6 Correct 3 ms 2948 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 462 ms 29180 KB Output is correct
9 Correct 488 ms 27612 KB Output is correct
10 Correct 3 ms 3028 KB Output is correct
11 Correct 132 ms 16436 KB Output is correct
12 Correct 774 ms 31888 KB Output is correct
13 Correct 350 ms 27944 KB Output is correct
14 Correct 305 ms 26816 KB Output is correct
15 Correct 208 ms 27400 KB Output is correct