oj.uz

답안 #1110964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1110964 2024-11-11T06:46:43 Z KasymK Birthday gift (IZhO18_treearray) C++17
56 / 100
 549 ms 76104 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2e5+5;
const int LOG = 20;
vector<int> adj[N];
int v[N], A[N][LOG], d[N];

void dfs(int x, int pr = -1){
    A[x][0] = pr;
    for(int i = 1; i < LOG; ++i)
        A[x][i] = A[A[x][i-1]][i-1];
    tr(it, adj[x])
        if(*it!=pr){
            d[*it] = d[x]+1;
            dfs(*it, x);
        }
}

int al(int x, int k){
    if(d[x]<k)
        return -1;
    for(int i = LOG-1; i >= 0; --i)
        if(k>>i&1){
            if(A[x][i]==-1)
                return -1;
            x = A[x][i];
        }
    return x;
}

int lca(int a, int b){
    if(d[b]>d[a])
        swap(a, b);
    a = al(a, d[a]-d[b]);
    if(a==b)
        return a;
    for(int i = LOG-1; i >= 0; --i)
        if(A[a][i] != A[b][i])
            a = A[a][i], b = A[b][i];
    return A[a][0];
}

int main(){
    // freopen("file.txt", "r", stdin);
    int n, m, q;
    scanf("%d%d%d", &n, &m, &q);
    for(int i = 1; i < n; ++i){
        int a, b;
        scanf("%d%d", &a, &b);
        adj[a].pb(b);
        adj[b].pb(a);
    }
    dfs(1);
    for(int i = 1; i <= m; ++i){
        int x;
        scanf("%d", &x);
        v[i] = x;
    }
    vector<set<pii>> A(n+1);
    for(int i = 1; i <= m; ++i)
        A[v[i]].insert({i, i});
    for(int i = 1; i < m; ++i)
        A[lca(v[i], v[i+1])].insert({i, i+1});
    while(q--){
        int op;
        scanf("%d", &op);
        if(op==1){
            int k, u;
            scanf("%d%d", &k, &u);
            A[v[k]].erase({k, k});
            if(k >= 1)
                A[lca(v[k-1], v[k])].erase({k-1, k});
            if(k+1<=m)
                A[lca(v[k], v[k+1])].erase({k, k+1});
            v[k] = u;
            A[v[k]].insert({k, k});
            if(k>=1)
                A[lca(v[k-1], v[k])].insert({k-1, k});
            if(k+1<=m)
                A[lca(v[k], v[k+1])].insert({k, k+1});
            continue;
        }
        int l, r, val;
        scanf("%d%d%d", &l, &r, &val);
        auto ii = A[val].lower_bound({l, l});
        if(ii==A[val].end() or ii->ss>r)
            printf("-1 -1\n");
        else
            printf("%d %d\n", ii->ff, ii->ss);
    }
    return 0;
}

Compilation message

treearray.cpp: In function 'int main()':
treearray.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     scanf("%d%d%d", &n, &m, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
treearray.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         scanf("%d%d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~
treearray.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
treearray.cpp:78:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |         scanf("%d", &op);
      |         ~~~~~^~~~~~~~~~~
treearray.cpp:81:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |             scanf("%d%d", &k, &u);
      |             ~~~~~^~~~~~~~~~~~~~~~
treearray.cpp:96:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |         scanf("%d%d%d", &l, &r, &val);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9808 KB n=5
2 Correct 3 ms 9808 KB n=100
3 Correct 3 ms 9808 KB n=100
4 Correct 3 ms 9808 KB n=100
5 Correct 3 ms 9808 KB n=100
6 Correct 3 ms 9808 KB n=100
7 Correct 2 ms 9808 KB n=100
8 Correct 2 ms 9808 KB n=100
9 Correct 2 ms 9808 KB n=100
10 Correct 3 ms 9808 KB n=100
11 Correct 3 ms 9976 KB n=100
12 Correct 3 ms 9808 KB n=100
13 Correct 3 ms 9976 KB n=100
14 Correct 4 ms 9808 KB n=100
15 Correct 3 ms 9808 KB n=100
16 Correct 3 ms 9808 KB n=100
17 Correct 2 ms 9808 KB n=100
18 Correct 3 ms 9808 KB n=100
19 Correct 3 ms 9808 KB n=100
20 Correct 3 ms 9808 KB n=100
21 Correct 3 ms 9808 KB n=100
22 Correct 3 ms 9976 KB n=100
23 Correct 3 ms 9808 KB n=100
24 Correct 3 ms 9820 KB n=100
25 Correct 3 ms 9808 KB n=100
26 Correct 3 ms 9808 KB n=12
27 Correct 3 ms 9808 KB n=100
28 Correct 3 ms 9808 KB n=500
29 Correct 3 ms 9976 KB n=500
30 Correct 3 ms 9808 KB n=500
31 Correct 3 ms 9808 KB n=500
32 Correct 3 ms 9808 KB n=500
33 Correct 3 ms 9808 KB n=500
34 Correct 3 ms 9808 KB n=500
35 Correct 3 ms 9976 KB n=500
36 Correct 3 ms 9808 KB n=500
37 Correct 3 ms 9808 KB n=500
38 Correct 3 ms 9808 KB n=500
39 Correct 4 ms 9808 KB n=500
40 Correct 3 ms 9808 KB n=500
41 Correct 3 ms 9892 KB n=500
42 Correct 3 ms 9808 KB n=500
43 Correct 3 ms 9808 KB n=500
44 Correct 4 ms 9980 KB n=500
45 Correct 3 ms 9808 KB n=500
46 Correct 3 ms 9808 KB n=500
47 Correct 4 ms 9808 KB n=500
48 Correct 4 ms 9808 KB n=500
49 Correct 3 ms 9808 KB n=500
50 Correct 5 ms 9808 KB n=500
51 Correct 3 ms 9976 KB n=500
52 Correct 4 ms 9808 KB n=500
53 Correct 3 ms 9808 KB n=500
54 Correct 4 ms 9808 KB n=500
55 Correct 3 ms 9808 KB n=278
56 Correct 3 ms 9808 KB n=500
57 Correct 3 ms 9808 KB n=500
58 Correct 3 ms 9808 KB n=500
59 Correct 5 ms 10232 KB n=2000
60 Correct 5 ms 10488 KB n=2000
61 Correct 5 ms 10064 KB n=2000
62 Correct 5 ms 10064 KB n=2000
63 Correct 5 ms 10064 KB n=2000
64 Correct 5 ms 10064 KB n=2000
65 Correct 5 ms 10064 KB n=2000
66 Correct 5 ms 10320 KB n=2000
67 Correct 5 ms 10064 KB n=2000
68 Correct 5 ms 10064 KB n=2000
69 Correct 4 ms 10192 KB n=2000
70 Correct 4 ms 10064 KB n=2000
71 Correct 4 ms 10064 KB n=2000
72 Correct 4 ms 10064 KB n=2000
73 Correct 4 ms 10064 KB n=2000
74 Correct 4 ms 10064 KB n=1844
75 Correct 4 ms 10064 KB n=2000
76 Correct 5 ms 10196 KB n=2000
77 Correct 5 ms 10064 KB n=2000
78 Correct 5 ms 10064 KB n=2000
79 Correct 5 ms 10168 KB n=2000
80 Correct 5 ms 10320 KB n=2000
81 Correct 5 ms 10064 KB n=2000
82 Correct 5 ms 10232 KB n=2000
83 Correct 5 ms 10064 KB n=2000
84 Correct 4 ms 10064 KB n=2000
85 Correct 5 ms 10064 KB n=2000
86 Correct 5 ms 10064 KB n=2000
87 Correct 4 ms 10248 KB n=2000
88 Correct 4 ms 10320 KB n=2000
89 Correct 4 ms 10320 KB n=2000
90 Correct 5 ms 10320 KB n=2000
91 Correct 4 ms 10064 KB n=2000
92 Correct 412 ms 59224 KB n=200000
93 Correct 549 ms 71572 KB n=200000
94 Correct 519 ms 76104 KB n=200000
95 Correct 484 ms 64860 KB n=200000
96 Incorrect 473 ms 64868 KB Wrong range.
97 Halted 0 ms 0 KB -