제출 #1166914

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1166914		SmuggingSpun	Birthday gift (IZhO18_treearray)	C++20	100 / 100	3637 ms	78204 KiB

treearray

#include<bits/stdc++.h>
#define taskname "C"
using namespace std;
template<class T>void minimize(T& a, T b){
    if(a > b){
        a = b;
    }
}
template<class T>void maximize(T& a, T b){
    if(a < b){
        a = b;
    }
}
int n, m, q;
namespace sub1{
    void solve(){
        vector<vector<int>>g(n + 1);
        for(int i = 1; i < n; i++){
            int u, v;
            cin >> u >> v;
            g[u].emplace_back(v);
            g[v].emplace_back(u);
        }
        vector<int>parent(n + 1), h(n + 1);
        function<void(int)>dfs;
        dfs = [&] (int s){
            for(int& d : g[s]){
                if(d != parent[s]){
                    h[d] = h[parent[d] = s] + 1;
                    dfs(d);
                }
            }
        };
        dfs(parent[1] = h[1] = 1);
        auto lca = [&] (int u, int v){
            while(u != v){
                if(h[u] < h[v]){
                    swap(u, v);
                }
                u = parent[u];
            }
            return u;
        };
        vector<int>a(m + 1);
        for(int i = 1; i <= m; i++){
            cin >> a[i];
        }
        for(int _ = 0; _ < q; _++){
            int _t;
            cin >> _t;
            if(_t == 1){
                int p;
                cin >> p >> a[p];
            }
            else{
                int l, r, v;
                cin >> l >> r >> v;
                int L = -1, R = -1;
                for(int i = l; i <= r && L == -1; i++){
                    int u = a[i];
                    for(int j = i; j <= r; j++){
                        if((u = lca(u, a[j])) == v){
                            L = i;
                            R = j;
                            break;
                        }
                    }
                }
                cout << L << " " << R << "\n";
            }
        }
    }
}
namespace sub23{
    void solve(){
        vector<vector<int>>g(n + 1);
        for(int i = 1; i < n; i++){
            int u, v;
            cin >> u >> v;
            g[u].emplace_back(v);
            g[v].emplace_back(u);
        }
        vector<int>fir(n + 1), las(n + 1), h(n + 1), euler;
        function<void(int, int)>dfs;
        dfs = [&] (int s, int p){
            fir[s] = las[s] = euler.size();
            euler.emplace_back(s);
            for(int& d : g[s]){
                if(d != p){
                    h[d] = h[s] + 1;
                    dfs(d, s);
                    las[s] = euler.size();
                    euler.emplace_back(s);
                }
            }
        };
        dfs(1, h[1] = 0);
        vector<vector<pair<int, int>>>spt(euler.size(), vector<pair<int, int>>(12));
        vector<int>log_v(euler.size() + 1);
        log_v[0] = -1;
        for(int i = 0; i < euler.size(); i++){
            spt[i][0] = make_pair(h[euler[i]], euler[i]);
            log_v[i + 1] = log_v[(i + 1) >> 1] + 1;
        }
        for(int j = 1; j < 12; j++){
            for(int i = 0; i + (1 << j) <= euler.size(); i++){
                spt[i][j] = min(spt[i][j - 1], spt[i + (1 << (j - 1))][j - 1]);
            }
        }
        auto lca = [&] (int L, int R){
            int k = log_v[R - L + 1];
            return min(spt[L][k], spt[R - (1 << k) + 1][k]).second;
        };
        vector<int>a(m + 1);
        for(int i = 1; i <= m; i++){
            cin >> a[i];
        }
        vector<int>st_fir(m << 2), st_las(m << 2);
        auto fix = [&] (int id){
            st_fir[id] = min(st_fir[id << 1], st_fir[id << 1 | 1]);
            st_las[id] = max(st_las[id << 1], st_las[id << 1 | 1]);
        };
        function<void(int, int, int)>build;
        build = [&] (int id, int l, int r){
            if(l == r){
                st_fir[id] = fir[a[l]];
                st_las[id] = las[a[l]];
                return;
            }
            int m = (l + r) >> 1;
            build(id << 1, l, m);
            build(id << 1 | 1, m + 1, r);
            fix(id);
        };
        build(1, 1, m);
        function<void(int, int, int, int)>update;
        update = [&] (int id, int l, int r, int p){
            if(l == r){
                st_fir[id] = fir[a[l]];
                st_las[id] = las[a[l]];
                return;
            }
            int m = (l + r) >> 1;
            if(m < p){
                update(id << 1 | 1, m + 1, r, p);
            }
            else{
                update(id << 1, l, m, p);
            }
            fix(id);
        };
        int L, R;
        function<void(int, int, int, int, int)>get;
        get = [&] (int id, int l, int r, int u, int v){
            if(l > v || r < u){
                return;
            }
            if(u <= l && v >= r){
                maximize(R, st_las[id]);
                minimize(L, st_fir[id]);
                return;
            }
            int m = (l + r) >> 1;
            get(id << 1, l, m, u, v);
            get(id << 1 | 1, m + 1, r, u, v);
        };
        for(int _ = 0; _ < q; _++){
            int _t;
            cin >> _t;
            if(_t == 1){
                int p;
                cin >> p >> a[p];
                update(1, 1, m, p);
            }
            else{
                int l, r, v, l_ans = -1, r_ans = -1;
                cin >> l >> r >> v;
                for(int i = l; i <= r && l_ans == -1; i++){
                    int low = i, high = r;
                    while(low <= high){
                        int mid = (low + high) >> 1;
                        L = euler.size();
                        R = -1;
                        get(1, 1, m, i, mid);
                        int u = lca(L, R);
                        if(h[u] < h[v]){
                            high = mid - 1;
                        }
                        else if(h[u] > h[v]){
                            low = mid + 1;
                        }
                        else{
                            if(u == v){
                                l_ans = i;
                                r_ans = mid;
                            }
                            break;
                        }
                    }
                }
                cout << l_ans << " " << r_ans << "\n";
            }
        }
    }
}
namespace sub4{
    const int lim = 2e5 + 5;
    int h[lim], a[lim], up[lim][18];
    set<int>p[lim], sp[lim];
    vector<int>g[lim];
    void dfs(int s){
        for(int& d : g[s]){
            if(d != up[s][0]){
                h[d] = h[up[d][0] = s] + 1;
                for(int i = 1; i < 18; i++){
                    up[d][i] = up[up[d][i - 1]][i - 1];
                }
                dfs(d);
            }
        }
    }
    int lca(int u, int v){
        if(h[u] < h[v]){
            swap(u, v);
        }
        for(int i = 0, k = h[u] - h[v]; i < 18; i++){
            if(1 << i & k){
                u = up[u][i];
            }
        }
        if(u == v){
            return u;
        }
        for(int i = 17; i > -1; i--){
            if(up[u][i] != up[v][i]){
                u = up[u][i];
                v = up[v][i];
            }
        }
        return up[u][0];
    }
    void solve(){
        for(int i = 1; i < n; i++){
            int u, v;
            cin >> u >> v;
            g[u].emplace_back(v);
            g[v].emplace_back(u);
        }
        memset(up, h[1] = 0, sizeof(up));
        dfs(1);
        for(int i = 1; i <= m; i++){
            cin >> a[i];
            sp[a[i]].insert(i);
        }
        for(int i = 1; i < m; i++){
            p[lca(a[i], a[i + 1])].insert(i);
        }
        for(int _ = 0; _ < q; _++){
            int _t;
            cin >> _t;
            if(_t == 1){
                int i, v;
                cin >> i >> v;
                if(i > 1){
                    p[lca(a[i], a[i - 1])].erase(i - 1);
                    p[lca(v, a[i - 1])].insert(i - 1);
                }
                if(i < m){
                    p[lca(a[i], a[i + 1])].erase(i);
                    p[lca(v, a[i + 1])].insert(i);
                }
                sp[a[i]].erase(i);
                sp[a[i] = v].insert(i);
            }
            else{
                int l, r, v;
                cin >> l >> r >> v;
                auto it = p[v].lower_bound(l);
                if(it != p[v].end() && *it < r){
                    cout << *it << " " << *it + 1 << "\n";
                }
                else{
                    auto other_it = sp[v].lower_bound(l);
                    if(other_it != sp[v].end() && *other_it <= r){
                        cout << *other_it << " " << *other_it << "\n";
                    }
                    else{
                        cout << "-1 -1\n";
                    }
                }
            }
        }
    }
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
    cin >> n >> m >> q;
    if(max({n, m, q}) <= 100){
        sub1::solve();
    }
    else if(max({n, m, q}) <= 2000){
        sub23::solve();
    }
    else{
        sub4::solve();
    }
}

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

treearray.cpp: In function 'int main()':
treearray.cpp:298:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  298 |                 freopen(taskname".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

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