제출 #1123245

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123245		gdragon	Birthday gift (IZhO18_treearray)	C++20	100 / 100	805 ms	81336 KiB

treearray

#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 2e5 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
int mul(int x, int y) {return 1LL * x * y % mod;}
// -----------------------------------------//
const int LOG = 17;
int n, m, q;
int a[N], par[N][LOG + 2], high[N], tin[N], tout[N];
vector<int> adj[N];
void read() {
    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);
    }
    for(int i = 1; i <= m; i++) cin >> a[i];
}
int timer = 0;
void dfs(int u) {
    tin[u] = ++timer;
    for(int v: adj[u]) if (v != par[u][0]) {
        high[v] = high[u] + 1;
        par[v][0] = u;
        dfs(v);
    }
    tout[u] = timer;
}
bool isChild(int u, int p) {
    return tin[p] <= tin[u] && tin[u] <= tout[p];
}
int LCA(int u, int v) {
    if (high[u] < high[v]) swap(u, v);
    int d = high[u] - high[v];
    for(int i = LOG; i >= 0; i--) if (d & (1 << i)) u = par[u][i];
    if (u == v) return u;
    for(int i = LOG; i >= 0; i--) if (par[u][i] != par[v][i]) {
        u = par[u][i];
        v = par[v][i];
    } 
    return par[u][0];
}
void sub3() {
    while(q--) {
        int type; cin >> type;
        if (type == 1) {
            int pos, v; cin >> pos >> v;
            a[pos] = v;
        }
        else {
            int l, r, p; cin >> l >> r >> p;
            int sta = 0, lca = 0;
            bool ok = 0;
            for(int i = l; i <= r; i++) {
                if (isChild(a[i], p)) {
                    sta = (sta == 0 ? i : sta);
                    lca = LCA(lca, a[i]);
                    if (lca == p) {
                        ok = 1;
                        cout << sta << ' ' << i << endl;
                        break;
                    }
                } 
                else {
                    lca = 0;
                    sta = 0;
                }
            }
            if (!ok) cout << -1 << ' ' << -1 << endl;
        }
    }
}
multiset<int> node[N], lca[N];
int tmp[N];
void lastsub() {
    for(int i = 1; i <= m; i++) {
        node[a[i]].insert(i);
        if (i > 1) {
            tmp[i] = LCA(a[i], a[i - 1]);
            lca[tmp[i]].insert(i);
        }
    }
    while(q--) {
        int type; cin >> type;
        if (type == 1) {
            int pos, v; cin >> pos >> v;
            if (a[pos] == v) continue;
            node[a[pos]].erase(node[a[pos]].find(pos));
            if (pos > 1) lca[tmp[pos]].erase(lca[tmp[pos]].find(pos));
            if (pos < m) lca[tmp[pos + 1]].erase(lca[tmp[pos + 1]].find(pos + 1));
            a[pos] = v;
            node[a[pos]].insert(pos);
            if (pos > 1) {
                tmp[pos] = LCA(a[pos], a[pos - 1]);
                lca[tmp[pos]].insert(pos);
            }
            if (pos < m) {
                tmp[pos + 1] = LCA(a[pos], a[pos + 1]);
                lca[tmp[pos + 1]].insert(pos + 1);
            }
            continue;
        }
        int l, r, p; cin >> l >> r >> p;
        auto it = node[p].lower_bound(l);
        if (it != node[p].end() && (*it) <= r) cout << (*it) << ' ' << (*it);
        else {
            it = lca[p].upper_bound(l);
            if (it != lca[p].end() && (*it) <= r) {
                cout << (*it) - 1 << ' ' << (*it);
            }
            else cout << -1 << ' ' << -1;
        }
        cout << endl;
    }
}
void solve() {
    dfs(1);
    for(int j = 1; j <= LOG; j++) {
        for(int i = 1; i <= n; i++) {
            par[i][j] = par[par[i][j - 1]][j - 1];
        }
    }
    lastsub(); return;
    if (max(n, q) <= 2000) sub3();
    else lastsub();

}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

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

treearray.cpp: In function 'int main()':
treearray.cpp:150:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  150 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
treearray.cpp:151:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  151 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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