oj.uz

답안 #667450

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667450 2022-12-01T11:35:16 Z ljuba Birthday gift (IZhO18_treearray) C++17
56 / 100
 1217 ms 76728 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(const char *x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m" << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x); cerr << "\033[0m";
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

void solve() {
    int n, m, q;
    cin >> n >> m >> q;

    vvi adj(n);

    for(int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    const int LOG = 31 - __builtin_clz(n) + 4;

    vvi up(n, vi(LOG));
    vi dep(n);

    auto dfs = [&](auto &self, int s, int p) -> void {
        up[s][0] = p;

        for(int i = 1; i < LOG; ++i) {
            if(up[s][i - 1] == -1) {
                up[s][i] = -1;
            } else {
                up[s][i] = up[up[s][i - 1]][i - 1];
            }
        }

        for(auto e : adj[s]) {
            if(e == p) continue;
            dep[e] = dep[s] + 1;
            self(self, e, s);
        }
    };

    dfs(dfs, 0, -1);

    //dbg(dep);
    
    dbg(up);

    auto lca = [&](int u, int v) {
        if(dep[u] < dep[v]) swap(u, v);

        //dep[u] >= dep[v]
        int k = dep[u] - dep[v];

        for(int i = 0; i < LOG; ++i) {
            if((k >> i) & 1) {
                u = up[u][i];
            }
        }

        if(u == v) return u;

        for(int i = LOG - 1; i >= 0; --i) {
            if(up[u][i] != up[v][i]) {
                u = up[u][i];
                v = up[v][i];
            }
        }
        
        return up[u][0];
    };

    vi a(m);
    for(auto &z : a) cin >> z;
    for(auto &z : a) --z;

    set<int> gdeJed[n];

    for(int i = 0; i < m; ++i) {
        gdeJed[a[i]].insert(i);
    }

    set<int> gdeDva[n];

    for(int i = 0; i + 1 < m; ++i) {
        int x = lca(a[i], a[i + 1]);
        gdeDva[x].insert(i);
    }

    dbg(":)");

    while(q--) {
        int t;
        cin >> t;

        auto calc = [&](int i) {
            if(i < 0) return -1;
            if(i + 1 >= n) return -1;
            return lca(a[i], a[i + 1]);
        };

        if(t == 1) {
            int i, v;
            cin >> i >> v;
            --i, --v;

            gdeJed[a[i]].erase(i);

            int prvi = calc(i - 1);

            if(prvi != -1) {
                gdeDva[prvi].erase(i - 1);
            }

            int drugi = calc(i);

            if(drugi != -1) {
                gdeDva[drugi].erase(i);
            }

            a[i] = v;

            gdeJed[a[i]].insert(i);

            prvi = calc(i - 1);

            if(prvi != -1) {
                gdeDva[prvi].insert(i - 1);
            }

            drugi = calc(i);

            if(drugi != -1) {
                gdeDva[drugi].insert(i);
            }
        } else {
            int l, r, v;
            cin >> l >> r >> v;
            --l, --r, --v;
            auto it = gdeJed[v].lower_bound(l);

            if(it != gdeJed[v].end() && *it <= r) {
                cout << *it + 1 << " " << *it + 1 << nl;
                continue;
            }

            it = gdeDva[v].lower_bound(l);

            if(it != gdeDva[v].end() && *it + 1 <= r) {
                cout << *it + 1 << " " << *it + 2 << nl;
                continue;
            }

            cout << -1 << " " << -1 << nl;
        }
    }
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int testCases = 1;
    //cin >> testCases;
    while(testCases--)
        solve();
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=5
2 Correct 1 ms 340 KB n=100
3 Correct 0 ms 340 KB n=100
4 Correct 0 ms 340 KB n=100
5 Correct 1 ms 340 KB n=100
6 Correct 1 ms 340 KB n=100
7 Correct 0 ms 340 KB n=100
8 Correct 1 ms 340 KB n=100
9 Correct 1 ms 340 KB n=100
10 Correct 1 ms 340 KB n=100
11 Correct 1 ms 340 KB n=100
12 Correct 1 ms 340 KB n=100
13 Correct 0 ms 340 KB n=100
14 Correct 1 ms 340 KB n=100
15 Correct 0 ms 340 KB n=100
16 Correct 1 ms 340 KB n=100
17 Correct 1 ms 340 KB n=100
18 Correct 1 ms 340 KB n=100
19 Correct 1 ms 340 KB n=100
20 Correct 1 ms 340 KB n=100
21 Correct 1 ms 340 KB n=100
22 Correct 1 ms 340 KB n=100
23 Correct 1 ms 340 KB n=100
24 Correct 1 ms 340 KB n=100
25 Correct 0 ms 340 KB n=100
26 Correct 1 ms 212 KB n=12
27 Correct 1 ms 340 KB n=100

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=5
2 Correct 1 ms 340 KB n=100
3 Correct 0 ms 340 KB n=100
4 Correct 0 ms 340 KB n=100
5 Correct 1 ms 340 KB n=100
6 Correct 1 ms 340 KB n=100
7 Correct 0 ms 340 KB n=100
8 Correct 1 ms 340 KB n=100
9 Correct 1 ms 340 KB n=100
10 Correct 1 ms 340 KB n=100
11 Correct 1 ms 340 KB n=100
12 Correct 1 ms 340 KB n=100
13 Correct 0 ms 340 KB n=100
14 Correct 1 ms 340 KB n=100
15 Correct 0 ms 340 KB n=100
16 Correct 1 ms 340 KB n=100
17 Correct 1 ms 340 KB n=100
18 Correct 1 ms 340 KB n=100
19 Correct 1 ms 340 KB n=100
20 Correct 1 ms 340 KB n=100
21 Correct 1 ms 340 KB n=100
22 Correct 1 ms 340 KB n=100
23 Correct 1 ms 340 KB n=100
24 Correct 1 ms 340 KB n=100
25 Correct 0 ms 340 KB n=100
26 Correct 1 ms 212 KB n=12
27 Correct 1 ms 340 KB n=100
28 Correct 1 ms 468 KB n=500
29 Correct 1 ms 468 KB n=500
30 Correct 1 ms 468 KB n=500
31 Correct 1 ms 468 KB n=500
32 Correct 1 ms 468 KB n=500
33 Correct 1 ms 468 KB n=500
34 Correct 1 ms 468 KB n=500
35 Correct 1 ms 468 KB n=500
36 Correct 1 ms 468 KB n=500
37 Correct 1 ms 468 KB n=500
38 Correct 1 ms 468 KB n=500
39 Correct 1 ms 468 KB n=500
40 Correct 1 ms 468 KB n=500
41 Correct 1 ms 468 KB n=500
42 Correct 1 ms 468 KB n=500
43 Correct 1 ms 468 KB n=500
44 Correct 1 ms 468 KB n=500
45 Correct 1 ms 468 KB n=500
46 Correct 1 ms 468 KB n=500
47 Correct 1 ms 468 KB n=500
48 Correct 1 ms 468 KB n=500
49 Correct 1 ms 468 KB n=500
50 Correct 1 ms 468 KB n=500
51 Correct 1 ms 468 KB n=500
52 Correct 1 ms 468 KB n=500
53 Correct 1 ms 468 KB n=500
54 Correct 2 ms 468 KB n=500
55 Correct 1 ms 340 KB n=278
56 Correct 1 ms 468 KB n=500
57 Correct 1 ms 468 KB n=500
58 Correct 1 ms 468 KB n=500

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=5
2 Correct 1 ms 340 KB n=100
3 Correct 0 ms 340 KB n=100
4 Correct 0 ms 340 KB n=100
5 Correct 1 ms 340 KB n=100
6 Correct 1 ms 340 KB n=100
7 Correct 0 ms 340 KB n=100
8 Correct 1 ms 340 KB n=100
9 Correct 1 ms 340 KB n=100
10 Correct 1 ms 340 KB n=100
11 Correct 1 ms 340 KB n=100
12 Correct 1 ms 340 KB n=100
13 Correct 0 ms 340 KB n=100
14 Correct 1 ms 340 KB n=100
15 Correct 0 ms 340 KB n=100
16 Correct 1 ms 340 KB n=100
17 Correct 1 ms 340 KB n=100
18 Correct 1 ms 340 KB n=100
19 Correct 1 ms 340 KB n=100
20 Correct 1 ms 340 KB n=100
21 Correct 1 ms 340 KB n=100
22 Correct 1 ms 340 KB n=100
23 Correct 1 ms 340 KB n=100
24 Correct 1 ms 340 KB n=100
25 Correct 0 ms 340 KB n=100
26 Correct 1 ms 212 KB n=12
27 Correct 1 ms 340 KB n=100
28 Correct 1 ms 468 KB n=500
29 Correct 1 ms 468 KB n=500
30 Correct 1 ms 468 KB n=500
31 Correct 1 ms 468 KB n=500
32 Correct 1 ms 468 KB n=500
33 Correct 1 ms 468 KB n=500
34 Correct 1 ms 468 KB n=500
35 Correct 1 ms 468 KB n=500
36 Correct 1 ms 468 KB n=500
37 Correct 1 ms 468 KB n=500
38 Correct 1 ms 468 KB n=500
39 Correct 1 ms 468 KB n=500
40 Correct 1 ms 468 KB n=500
41 Correct 1 ms 468 KB n=500
42 Correct 1 ms 468 KB n=500
43 Correct 1 ms 468 KB n=500
44 Correct 1 ms 468 KB n=500
45 Correct 1 ms 468 KB n=500
46 Correct 1 ms 468 KB n=500
47 Correct 1 ms 468 KB n=500
48 Correct 1 ms 468 KB n=500
49 Correct 1 ms 468 KB n=500
50 Correct 1 ms 468 KB n=500
51 Correct 1 ms 468 KB n=500
52 Correct 1 ms 468 KB n=500
53 Correct 1 ms 468 KB n=500
54 Correct 2 ms 468 KB n=500
55 Correct 1 ms 340 KB n=278
56 Correct 1 ms 468 KB n=500
57 Correct 1 ms 468 KB n=500
58 Correct 1 ms 468 KB n=500
59 Correct 3 ms 980 KB n=2000
60 Correct 3 ms 996 KB n=2000
61 Correct 4 ms 980 KB n=2000
62 Correct 4 ms 980 KB n=2000
63 Correct 3 ms 900 KB n=2000
64 Correct 3 ms 980 KB n=2000
65 Correct 3 ms 980 KB n=2000
66 Correct 4 ms 980 KB n=2000
67 Correct 4 ms 980 KB n=2000
68 Correct 3 ms 980 KB n=2000
69 Correct 3 ms 980 KB n=2000
70 Correct 3 ms 980 KB n=2000
71 Correct 3 ms 980 KB n=2000
72 Correct 3 ms 980 KB n=2000
73 Correct 3 ms 980 KB n=2000
74 Correct 4 ms 852 KB n=1844
75 Correct 3 ms 980 KB n=2000
76 Correct 3 ms 980 KB n=2000
77 Correct 4 ms 980 KB n=2000
78 Correct 4 ms 980 KB n=2000
79 Correct 4 ms 980 KB n=2000
80 Correct 3 ms 980 KB n=2000
81 Correct 4 ms 980 KB n=2000
82 Correct 3 ms 980 KB n=2000
83 Correct 3 ms 980 KB n=2000
84 Correct 3 ms 980 KB n=2000
85 Correct 4 ms 980 KB n=2000
86 Correct 4 ms 980 KB n=2000
87 Correct 3 ms 980 KB n=2000
88 Correct 3 ms 980 KB n=2000
89 Correct 3 ms 980 KB n=2000
90 Correct 4 ms 980 KB n=2000
91 Correct 3 ms 980 KB n=2000

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=5
2 Correct 1 ms 340 KB n=100
3 Correct 0 ms 340 KB n=100
4 Correct 0 ms 340 KB n=100
5 Correct 1 ms 340 KB n=100
6 Correct 1 ms 340 KB n=100
7 Correct 0 ms 340 KB n=100
8 Correct 1 ms 340 KB n=100
9 Correct 1 ms 340 KB n=100
10 Correct 1 ms 340 KB n=100
11 Correct 1 ms 340 KB n=100
12 Correct 1 ms 340 KB n=100
13 Correct 0 ms 340 KB n=100
14 Correct 1 ms 340 KB n=100
15 Correct 0 ms 340 KB n=100
16 Correct 1 ms 340 KB n=100
17 Correct 1 ms 340 KB n=100
18 Correct 1 ms 340 KB n=100
19 Correct 1 ms 340 KB n=100
20 Correct 1 ms 340 KB n=100
21 Correct 1 ms 340 KB n=100
22 Correct 1 ms 340 KB n=100
23 Correct 1 ms 340 KB n=100
24 Correct 1 ms 340 KB n=100
25 Correct 0 ms 340 KB n=100
26 Correct 1 ms 212 KB n=12
27 Correct 1 ms 340 KB n=100
28 Correct 1 ms 468 KB n=500
29 Correct 1 ms 468 KB n=500
30 Correct 1 ms 468 KB n=500
31 Correct 1 ms 468 KB n=500
32 Correct 1 ms 468 KB n=500
33 Correct 1 ms 468 KB n=500
34 Correct 1 ms 468 KB n=500
35 Correct 1 ms 468 KB n=500
36 Correct 1 ms 468 KB n=500
37 Correct 1 ms 468 KB n=500
38 Correct 1 ms 468 KB n=500
39 Correct 1 ms 468 KB n=500
40 Correct 1 ms 468 KB n=500
41 Correct 1 ms 468 KB n=500
42 Correct 1 ms 468 KB n=500
43 Correct 1 ms 468 KB n=500
44 Correct 1 ms 468 KB n=500
45 Correct 1 ms 468 KB n=500
46 Correct 1 ms 468 KB n=500
47 Correct 1 ms 468 KB n=500
48 Correct 1 ms 468 KB n=500
49 Correct 1 ms 468 KB n=500
50 Correct 1 ms 468 KB n=500
51 Correct 1 ms 468 KB n=500
52 Correct 1 ms 468 KB n=500
53 Correct 1 ms 468 KB n=500
54 Correct 2 ms 468 KB n=500
55 Correct 1 ms 340 KB n=278
56 Correct 1 ms 468 KB n=500
57 Correct 1 ms 468 KB n=500
58 Correct 1 ms 468 KB n=500
59 Correct 3 ms 980 KB n=2000
60 Correct 3 ms 996 KB n=2000
61 Correct 4 ms 980 KB n=2000
62 Correct 4 ms 980 KB n=2000
63 Correct 3 ms 900 KB n=2000
64 Correct 3 ms 980 KB n=2000
65 Correct 3 ms 980 KB n=2000
66 Correct 4 ms 980 KB n=2000
67 Correct 4 ms 980 KB n=2000
68 Correct 3 ms 980 KB n=2000
69 Correct 3 ms 980 KB n=2000
70 Correct 3 ms 980 KB n=2000
71 Correct 3 ms 980 KB n=2000
72 Correct 3 ms 980 KB n=2000
73 Correct 3 ms 980 KB n=2000
74 Correct 4 ms 852 KB n=1844
75 Correct 3 ms 980 KB n=2000
76 Correct 3 ms 980 KB n=2000
77 Correct 4 ms 980 KB n=2000
78 Correct 4 ms 980 KB n=2000
79 Correct 4 ms 980 KB n=2000
80 Correct 3 ms 980 KB n=2000
81 Correct 4 ms 980 KB n=2000
82 Correct 3 ms 980 KB n=2000
83 Correct 3 ms 980 KB n=2000
84 Correct 3 ms 980 KB n=2000
85 Correct 4 ms 980 KB n=2000
86 Correct 4 ms 980 KB n=2000
87 Correct 3 ms 980 KB n=2000
88 Correct 3 ms 980 KB n=2000
89 Correct 3 ms 980 KB n=2000
90 Correct 4 ms 980 KB n=2000
91 Correct 3 ms 980 KB n=2000
92 Correct 706 ms 75784 KB n=200000
93 Correct 1177 ms 74904 KB n=200000
94 Correct 1206 ms 74948 KB n=200000
95 Correct 678 ms 75836 KB n=200000
96 Correct 654 ms 75812 KB n=200000
97 Correct 1217 ms 75032 KB n=200000
98 Correct 675 ms 75784 KB n=200000
99 Correct 881 ms 75192 KB n=200000
100 Correct 699 ms 75812 KB n=200000
101 Correct 1161 ms 75000 KB n=200000
102 Correct 416 ms 76648 KB n=200000
103 Correct 411 ms 76676 KB n=200000
104 Correct 402 ms 76728 KB n=200000
105 Correct 433 ms 76496 KB n=200000
106 Correct 413 ms 76364 KB n=200000
107 Correct 409 ms 76496 KB n=200000
108 Correct 814 ms 75420 KB n=200000
109 Correct 793 ms 75468 KB n=200000
110 Correct 802 ms 75456 KB n=200000
111 Correct 666 ms 75740 KB n=200000
112 Correct 1152 ms 75124 KB n=200000
113 Correct 1147 ms 74896 KB n=200000
114 Correct 653 ms 75852 KB n=200000
115 Correct 1187 ms 74880 KB n=200000
116 Correct 653 ms 75592 KB n=200000
117 Correct 1161 ms 74748 KB n=200000
118 Correct 1190 ms 74756 KB n=200000
119 Correct 654 ms 75568 KB n=200000
120 Correct 1088 ms 74576 KB n=200000
121 Correct 1096 ms 74512 KB n=200000
122 Correct 1114 ms 74976 KB n=200000
123 Correct 435 ms 76024 KB n=200000
124 Incorrect 148 ms 15820 KB Wrong range.
125 Halted 0 ms 0 KB -