Submission #1110964

#	Time	Username	Problem	Language	Result	Execution time	Memory
1110964		KasymK	Birthday gift (IZhO18_treearray)	C++17	56 / 100	549 ms	76104 KiB

treearray

#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 (stderr)

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 / 12
• Subtask 2: 18 / 18
• Subtask 3: 26 / 26
• Subtask 4: 0 / 44