제출 #1097144

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1097144		lmToT27	Birthday gift (IZhO18_treearray)	C++17	100 / 100	651 ms	101456 KiB

treearray

#include <bits/stdc++.h>
#define all(dataStructure) dataStructure.begin(),dataStructure.end()
#define ll long long

using namespace std;
namespace std {
        template <typename T, int D>
        struct _vector : public vector <_vector <T, D - 1>> {
                static_assert(D >= 1, "Dimension must be positive!");
                template <typename... Args>
                _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
        };
        // _vector <int, 3> a(n, m, k);: int a[n][m][k].
        // _vector <int, 3> a(n, m, k, x);: int a[n][m][k] initialized with x.
        template <typename T>
        struct _vector <T, 1> : public vector <T> {
                _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
        };
}

const int MAX = 2e5 + 3;
const ll MOD[] = {1000000007, 998244353};

int n, m, q, a[MAX];
vector <int> adj[MAX];
int depth[MAX], pa[MAX][18];
set <int> f[MAX], g[MAX];

void dfs(int u, int pre) {
        depth[u] = depth[pre] + 1;
        pa[u][0] = pre;
        for (int i = 1; i <= 17; i++) pa[u][i] = pa[pa[u][i - 1]][i - 1];
        for (int &v : adj[u]) if (v != pre) dfs(v, u);
}

int __lca(int u, int v) {
        if (depth[u] < depth[v]) swap(u, v);
        int dist = depth[u] - depth[v];

        while (dist) {
                u = pa[u][__builtin_ctz(dist)];
                dist -= dist & -dist;
        }
        
        if (u == v) {
                return u;
        } else {
                for (int i = 17; i >= 0; i--) {
                        if (pa[u][i] != pa[v][i]) {
                                u = pa[u][i];
                                v = pa[v][i];
                        }
                }
                return pa[u][0];
        }
}

void query(int l, int r, int lca) {
        auto p = f[lca].lower_bound(l);
        if (*p <= r) return void(cout << *p << ' ' << *p << '\n');
        auto q = g[lca].lower_bound(l);
        if (*q < r) return void(cout << *q << ' ' << *q + 1 << '\n');
        cout << "-1 -1\n";
}

void Solve() {
        cin >> n >> m >> q;
        for (int i = 1; i < n; i++) {
                int u, v;
                cin >> u >> v;
                adj[u].push_back(v);
                adj[v].push_back(u);
        }
        dfs(1, 0);
        for (int i = 1; i <= n; i++) {
                f[i].insert(m + 1);
                g[i].insert(m + 1);
        }
        for (int i = 1; i <= m; i++) {
                cin >> a[i];
                f[a[i]].insert(i);
        }
        for (int i = 1; i < m; i++) {
                g[__lca(a[i], a[i + 1])].insert(i);
        }
        int type, u, v, lca;
        while (q--) {
                cin >> type >> u >> v;
                if (type == 2) {
                        cin >> lca;
                        query(u, v, lca);
                } else {
                        f[a[u]].erase(u);
                        if (u > 1) {
                                g[__lca(a[u - 1], a[u])].erase(u - 1);
                        }
                        if (u < m) {
                                g[__lca(a[u], a[u + 1])].erase(u);
                        }
                        a[u] = v;
                        f[a[u]].insert(u);
                        if (u < m) {
                                g[__lca(a[u], a[u + 1])].insert(u);
                        }
                        if (u > 1) {
                                g[__lca(a[u - 1], a[u])].insert(u - 1);
                        }
                }
        }
}

int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);

        #define TASK "TASK"
        if (fopen(TASK".INP", "r")) {
                freopen(TASK".INP", "r", stdin);
                freopen(TASK".OUT", "w", stdout);
        }
        
        /* int TEST = 1; cin >> TEST; while (TEST--) */ Solve();

        cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
        return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

treearray.cpp: In function 'int32_t main()':
treearray.cpp:118:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |                 freopen(TASK".INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
treearray.cpp:119:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  119 |                 freopen(TASK".OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 18 / 18
• Subtask 3: 26 / 26
• Subtask 4: 44 / 44