oj.uz

Submission #668011

# Submission time Handle Problem Language Result Execution time Memory
668011 2022-12-02T14:27:09 Z haxorman Fountain (eJOI20_fountain) C++14
100 / 100
 383 ms 50380 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mxN = 2e5 + 7;

int sparse[20][mxN], dist[20][mxN], h[mxN];
pair<int,int> arr[mxN];
vector<pair<int,int>> graph[mxN];

void dfs(int u, int par, int weight) {
    sparse[0][u] = (par == -1 ? 0 : par);
    dist[0][u] = weight;
    h[u] = (par == -1 ? -1 : h[par]) + 1;
    
    for (int i = 1; i < 20; ++i) {
        sparse[i][u] = sparse[i - 1][sparse[i - 1][u]];
        dist[i][u] = dist[i - 1][u] + dist[i - 1][sparse[i - 1][u]];
    }

    for (auto p : graph[u]) {
        int v = p.first, w = p.second;
        dfs(v, u, w);
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	
    int n, q;
    cin >> n >> q;
    
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i].first >> arr[i].second;
    }


    vector<int> st;
    for (int i = 1; i <= n; ++i) {
        while (st.size() && arr[i].first > arr[st.back()].first) {
            graph[i].push_back({st.back(), arr[st.back()].second});
            st.pop_back();
        }
        st.push_back(i);
    }

    while (st.size()) {
        graph[0].push_back({st.back(), arr[st.back()].second});
        st.pop_back();
    }
    dfs(0, -1, 0);

    while (q--) {
        int ind, val;
        cin >> ind >> val;

        for (int i = 19; i >= 0 && val; --i) {
            if (dist[i][ind] && dist[i][ind] < val) {
                val -= dist[i][ind];
                ind = sparse[i][ind];
            }
        }
        cout << ind << "\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5460 KB Output is correct
3 Correct 3 ms 5560 KB Output is correct
4 Correct 4 ms 5688 KB Output is correct
5 Correct 4 ms 5716 KB Output is correct
6 Correct 5 ms 5716 KB Output is correct
7 Correct 5 ms 5716 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 46812 KB Output is correct
2 Correct 270 ms 44036 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5460 KB Output is correct
3 Correct 3 ms 5560 KB Output is correct
4 Correct 4 ms 5688 KB Output is correct
5 Correct 4 ms 5716 KB Output is correct
6 Correct 5 ms 5716 KB Output is correct
7 Correct 5 ms 5716 KB Output is correct
8 Correct 246 ms 46812 KB Output is correct
9 Correct 270 ms 44036 KB Output is correct
10 Correct 4 ms 5716 KB Output is correct
11 Correct 96 ms 28016 KB Output is correct
12 Correct 383 ms 50380 KB Output is correct
13 Correct 263 ms 47112 KB Output is correct
14 Correct 174 ms 45644 KB Output is correct
15 Correct 161 ms 46484 KB Output is correct