oj.uz

답안 #590665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590665 2022-07-06T08:27:57 Z FedShat Birthday gift (IZhO18_treearray) C++17
0 / 100
 0 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
using ll = long long;
constexpr int INF = (numeric_limits<int>::max()) / 2;
constexpr ll INFLL = (numeric_limits<ll>::max()) / 2;

template<class T>
istream &operator>>(istream &is, vector<T> &a) {
    for (auto &i: a) {
        is >> i;
    }
    return is;
}

struct lca {
    vector<vector<int>> g;
    vector<int> depth;
    vector<int> tin, tout;
    vector<pair<int, int>> tour;
    static constexpr int k = 20;
    vector<vector<pair<int, int>>> st;
    vector<int> prec;

    void dfs(int v, int p) {
        tin[v] = tour.size();
        tour.push_back({depth[v], v});
        if (p != -1) {
            depth[v] = depth[p] + 1;
        }
        for (auto u: g[v]) {
            if (u != p) {
                dfs(u, v);
                tour.push_back({depth[v], v});
            }
        }
        tour.push_back({depth[v], v});
        tout[v] = tour.size();
    }

    int getmin(int l, int r) {
        int len = prec[r - l];
        return min(st[len][l], st[len][r - (1 << len)]).second;
    }

    bool anc(int u, int v) {
        return tin[u] <= tin[v] && tout[v] <= tout[u];
    }

    int LCA(int u, int v) {
        if (anc(u, v)) {
            return u;
        }
        if (anc(v, u)) {
            return v;
        }
        if (tin[u] > tout[v]) {
            swap(u, v);
        }
        return getmin(tin[u], tout[v]);
    }

    lca(vector<vector<int>> g) : g(g) {
        int n = g.size();
        depth.resize(n);
        tin.resize(n);
        tout.resize(n);
        dfs(0, -1);
        int m = tour.size();
        prec.resize(m + 1);
        for (int i = 2; i <= m; ++i) {
            prec[i] = prec[i / 2] + 1;
        }
        st.resize(k, vector<pair<int, int>>(m, {INF, -1}));
        for (int i = 0; i < m; ++i) {
            st[0][i] = tour[i];
        }
        for (int i = 1; i < k; ++i) {
            for (int j = 0; j < m; ++j) {
                st[i][j] = min(st[i - 1][j], st[i - 1][min(m - 1, j + (1 << (i - 1)))]);
            }
        }
    }
};

int main() {
    cin.tie(0)->sync_with_stdio(0);
#ifdef __APPLE__
    freopen("input.txt", "r", stdin);
#endif
    int n, m, q;
    cin >> n >> m >> q;
    vector<vector<int>> g(n);
    for (int i = 0; i < n - 1; ++i) {
        int u, v;
        cin >> u >> v;
        --u;
        --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<int> a(m);
    cin >> a;
    for (auto &i: a) {
        --i;
    }
    vector<int> ap(m - 1);
    lca t(g);
    for (int i = 0; i + 1 < m; ++i) {
        ap[i] = t.LCA(a[i], a[i + 1]);
    }
    // auto calc = [&](int pos) {
    //     if (pos >= 0 && pos + 1 < m) {
    //         ap[pos] = t.LCA(a[pos], a[pos + 1]);
    //     }
    // };
    while (q--) {
        int tt;
        cin >> tt;
        if (tt == 1) {
            int pos, v;
            cin >> pos >> v;
            --pos;
            --v;
            a[pos] = v;
            for (int i = 0; i + 1 < m; ++i) {
                ap[i] = t.LCA(a[i], a[i + 1]);
            }
            // calc(pos);
            // calc(pos - 1);
        } else {
            int l, r, v;
            cin >> l >> r >> v;
            --l;// ap[l] is lca of (a[l], a[l + 1])
            --r;// ap[r - 1] is lca of (a[r - 2], a[r - 1])
            --v;
            bool ans = false;
            for (int i = l; i <= r; ++i) {
                if (a[i] == v) {
                    cout << i + 1 << " " << i + 1 << "\n";
                    ans = true;
                    break;
                }
            }
            for (int i = l; i < r; ++i) {
                if (ap[i] == v && !ans) {
                    cout << i + 1 << " " << i + 2 << "\n";
                    ans = true;
                    break;
                }
            }
            if (!ans) {
                cout << "-1 -1\n";
            }
        }
    }
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=5
2 Incorrect 0 ms 340 KB Wrong range.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=5
2 Incorrect 0 ms 340 KB Wrong range.
3 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=5
2 Incorrect 0 ms 340 KB Wrong range.
3 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=5
2 Incorrect 0 ms 340 KB Wrong range.
3 Halted 0 ms 0 KB -