oj.uz

Submission #893718

# Submission time Handle Problem Language Result Execution time Memory
893718 2023-12-27T10:17:17 Z vjudge1 Birthday gift (IZhO18_treearray) C++17
12 / 100
 25 ms 8932 KB 
// 以上帝的名义
// 候选硕士
#include <bits/stdc++.h>

#ifdef local
#include "algo/debug.h"
#else
#define dbg(x...) 0
#endif

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define Node int
#define at(i) find_by_order(i)
#define which(x) order_of_key(x)
#define SET tree<Node, null_type,less<Node>, rb_tree_tag,tree_order_statistics_node_update>

using namespace std ;
using ll = long long ;
using ld = long double ;

const int N = 2e5 + 5 ;

int n , m , q, a[N], p[N] ;
vector<int> g[N] ;

int tin[N], tout[N], timer , up[N][20] ;

void dfs(int v, int p) {
    tin[v] = ++timer ;
    up[v][0] = p ;
    for (int i = 1 ; i < 20 ; i++) {
        up[v][i] = up[up[v][i - 1]][i - 1] ;
    }
    for (auto to : g[v]) {
        if (to != p) {
            dfs(to, v) ;
        }
    }
    tout[v] = ++timer ;
}

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

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

int lca(int u, int v) {
    if (!u) return v ;
    if (!v) return u ;
    if (is(u, v)) return u ;
    if (is(v, u)) return v ;
    for (int i = 19 ; ~i ; i--) {
        if (!is(up[u][i], v)) {
            u = up[u][i] ;
        }
    }
    return up[u][0] ;
}

int t[N * 4] ;

void modify(int i, int x, int v, int tl, int tr) {
    if (tl == tr) {
        t[v] = x ;
    } else {
        int tm = (tl + tr) / 2 ;
        if (i <= tm) {
            modify(i, x, v * 2, tl, tm) ;
        } else {
            modify(i, x, v * 2 + 1, tm + 1, tr) ;
        }
        t[v] = lca(t[v * 2], t[v * 2 + 1]) ;
    }
}

int get(int l, int r, int v, int tl, int tr) {
    if (l > tr || r < tl) return 0 ;
    if (l <= tl && tr <= r) return t[v] ;
    int tm = (tl + tr) / 2 ;
    return lca(get(l, r,v * 2, tl, tm), get(l, r,v * 2 + 1 ,tm + 1, tr)) ;
}

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

int32_t main() {
    ios::sync_with_stdio(false) ;
    cin.tie(nullptr) ;
    cin >> n >> m >> q ;
    for (int i = 1 ; i < n ; i++) {
        int u , v ; cin >> u >> v;
        g[u].push_back(v) ;
        g[v].push_back(u) ;
    }
    for (int i = 1 ; i <= m ; i++) {
        cin >> a[i] ;
        p[a[i]] = i ;
    }
    dfs(1, 1) ;
    for (int i = 1 ; i <= m ; i++) {
        modify(i, a[i], 1, 1, m) ;
    }
//    dbg(get(1, 2, 1, 1, m)) ;
    for (int i = 0 ; i < q ; i++) {
        int cmd ; cin >> cmd ;
        if (cmd == 1) {
            int pos, v; cin >> pos >> v ;
            modify(pos, v, 1, 1, m) ;
        } else {
            int l, r, v; cin >> l >> r >> v ;
            int _l = -1, _r = -1 ;
            for (int j = l ; j <= min(r , l + 100) ; j++) {
                int L = j, R = r ;
                while (L < R) {
                    ll mid = (L + R + 1) / 2 ;
                    ll c = get(j, mid, 1, 1, m) ;
                    if (upper(c, v)) R = mid - 1 ;
                    else L = mid ;
                }
//                dbg(j, L, get(j, L, 1, 1, m)) ;
                if (get(j, L, 1, 1, m) == v) {
                    _l = j , _r = L ;
                    break ;
                }
            }
            for (int j = max(l, r - 100) ; j <= r ; j++) {
                int L = j, R = r ;
                while (L < R) {
                    ll mid = (L + R + 1) / 2 ;
                    ll c = get(j, mid, 1, 1, m) ;
                    if (upper(c, v)) R = mid - 1 ;
                    else L = mid ;
                }
//                dbg(j, L, get(j, L, 1, 1, m)) ;
                if (get(j, L, 1, 1, m) == v) {
                    _l = j , _r = L ;
                    break ;
                }
            }
            cout << _l << ' ' << _r << "\n" ;
        }
    }
    return 0 ;
}

// 希望白银

Compilation message

treearray.cpp:90: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   90 | #pragma GCC optimization ("O3")
      | 
treearray.cpp:91: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   91 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8792 KB n=5
2 Correct 4 ms 8792 KB n=100
3 Correct 3 ms 8796 KB n=100
4 Correct 2 ms 8796 KB n=100
5 Correct 2 ms 8792 KB n=100
6 Correct 9 ms 8796 KB n=100
7 Correct 9 ms 8796 KB n=100
8 Correct 4 ms 8796 KB n=100
9 Correct 4 ms 8892 KB n=100
10 Correct 7 ms 8792 KB n=100
11 Correct 5 ms 8796 KB n=100
12 Correct 2 ms 8796 KB n=100
13 Correct 2 ms 8792 KB n=100
14 Correct 2 ms 8796 KB n=100
15 Correct 2 ms 8796 KB n=100
16 Correct 2 ms 8932 KB n=100
17 Correct 3 ms 8796 KB n=100
18 Correct 2 ms 8796 KB n=100
19 Correct 2 ms 8796 KB n=100
20 Correct 3 ms 8796 KB n=100
21 Correct 2 ms 8796 KB n=100
22 Correct 2 ms 8796 KB n=100
23 Correct 5 ms 8796 KB n=100
24 Correct 5 ms 8796 KB n=100
25 Correct 2 ms 8916 KB n=100
26 Correct 2 ms 8796 KB n=12
27 Correct 6 ms 8920 KB n=100

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8792 KB n=5
2 Correct 4 ms 8792 KB n=100
3 Correct 3 ms 8796 KB n=100
4 Correct 2 ms 8796 KB n=100
5 Correct 2 ms 8792 KB n=100
6 Correct 9 ms 8796 KB n=100
7 Correct 9 ms 8796 KB n=100
8 Correct 4 ms 8796 KB n=100
9 Correct 4 ms 8892 KB n=100
10 Correct 7 ms 8792 KB n=100
11 Correct 5 ms 8796 KB n=100
12 Correct 2 ms 8796 KB n=100
13 Correct 2 ms 8792 KB n=100
14 Correct 2 ms 8796 KB n=100
15 Correct 2 ms 8796 KB n=100
16 Correct 2 ms 8932 KB n=100
17 Correct 3 ms 8796 KB n=100
18 Correct 2 ms 8796 KB n=100
19 Correct 2 ms 8796 KB n=100
20 Correct 3 ms 8796 KB n=100
21 Correct 2 ms 8796 KB n=100
22 Correct 2 ms 8796 KB n=100
23 Correct 5 ms 8796 KB n=100
24 Correct 5 ms 8796 KB n=100
25 Correct 2 ms 8916 KB n=100
26 Correct 2 ms 8796 KB n=12
27 Correct 6 ms 8920 KB n=100
28 Correct 2 ms 8796 KB n=500
29 Incorrect 25 ms 8796 KB Jury has the answer but participant has not
30 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8792 KB n=5
2 Correct 4 ms 8792 KB n=100
3 Correct 3 ms 8796 KB n=100
4 Correct 2 ms 8796 KB n=100
5 Correct 2 ms 8792 KB n=100
6 Correct 9 ms 8796 KB n=100
7 Correct 9 ms 8796 KB n=100
8 Correct 4 ms 8796 KB n=100
9 Correct 4 ms 8892 KB n=100
10 Correct 7 ms 8792 KB n=100
11 Correct 5 ms 8796 KB n=100
12 Correct 2 ms 8796 KB n=100
13 Correct 2 ms 8792 KB n=100
14 Correct 2 ms 8796 KB n=100
15 Correct 2 ms 8796 KB n=100
16 Correct 2 ms 8932 KB n=100
17 Correct 3 ms 8796 KB n=100
18 Correct 2 ms 8796 KB n=100
19 Correct 2 ms 8796 KB n=100
20 Correct 3 ms 8796 KB n=100
21 Correct 2 ms 8796 KB n=100
22 Correct 2 ms 8796 KB n=100
23 Correct 5 ms 8796 KB n=100
24 Correct 5 ms 8796 KB n=100
25 Correct 2 ms 8916 KB n=100
26 Correct 2 ms 8796 KB n=12
27 Correct 6 ms 8920 KB n=100
28 Correct 2 ms 8796 KB n=500
29 Incorrect 25 ms 8796 KB Jury has the answer but participant has not
30 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8792 KB n=5
2 Correct 4 ms 8792 KB n=100
3 Correct 3 ms 8796 KB n=100
4 Correct 2 ms 8796 KB n=100
5 Correct 2 ms 8792 KB n=100
6 Correct 9 ms 8796 KB n=100
7 Correct 9 ms 8796 KB n=100
8 Correct 4 ms 8796 KB n=100
9 Correct 4 ms 8892 KB n=100
10 Correct 7 ms 8792 KB n=100
11 Correct 5 ms 8796 KB n=100
12 Correct 2 ms 8796 KB n=100
13 Correct 2 ms 8792 KB n=100
14 Correct 2 ms 8796 KB n=100
15 Correct 2 ms 8796 KB n=100
16 Correct 2 ms 8932 KB n=100
17 Correct 3 ms 8796 KB n=100
18 Correct 2 ms 8796 KB n=100
19 Correct 2 ms 8796 KB n=100
20 Correct 3 ms 8796 KB n=100
21 Correct 2 ms 8796 KB n=100
22 Correct 2 ms 8796 KB n=100
23 Correct 5 ms 8796 KB n=100
24 Correct 5 ms 8796 KB n=100
25 Correct 2 ms 8916 KB n=100
26 Correct 2 ms 8796 KB n=12
27 Correct 6 ms 8920 KB n=100
28 Correct 2 ms 8796 KB n=500
29 Incorrect 25 ms 8796 KB Jury has the answer but participant has not
30 Halted 0 ms 0 KB -