Submission #555183

#	Time	Username	Problem	Language	Result	Execution time	Memory
555183		farhan132	Birthday gift (IZhO18_treearray)	C++17	100 / 100	1006 ms	78428 KiB

treearray

/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef int ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 2e5 + 5;

set < ll > s[N], t[N];
vector < ll > v[N];

ll par[N][20], d[N], a[N];

void dfs(ll s, ll p = 0, ll dp = 1){
    par[s][0] = p;
    for(ll i = 1; i < 20; i++) par[s][i] = par[par[s][i-1]][i-1];
    d[s] = dp;
    for(auto u : v[s]){
        if(u - p) dfs(u , s, dp + 1);
    }
    return;
}
ll lca(ll x, ll y){
    if(d[x] < d[y]) swap(x, y);
    for(ll i = 19; i >= 0; i--){
        if(d[x] - (1 << i) >= d[y]) x = par[x][i];
    }
    if(x == y) return x;
    for(ll i = 19; i >= 0; i--){
        if(par[x][i] != par[y][i]) x = par[x][i] , y = par[y][i];
    }
    return par[x][0];
}

void solve(){

  ll n, m, q;
  cin >> n >> m >> q;

  for(ll i = 1; i < n; i++){
    ll x , y;
    cin >> x >> y;
    v[x].pb(y);
    v[y].pb(x);
  }
  dfs(1);

  for(ll i = 1; i <= m; i++){
    cin >> a[i];
    t[a[i]].in(i);
    if(i > 1){
        s[lca(a[i-1],a[i])].in(i-1);
    }
  }
  while(q--){
    ll tt; cin >> tt;
    if(tt == 1){
        ll pos, x; cin >> pos >> x;
        t[a[pos]].erase(pos);
        t[x].in(pos);
        if(pos > 1){
            s[lca(a[pos-1], a[pos])].erase(pos-1);
            s[lca(a[pos-1], x)].in(pos-1);
        }
        if(pos < m){
            s[lca(a[pos], a[pos+1])].erase(pos);
            s[lca(x, a[pos+1])].in(pos);
        }
        a[pos] = x;
    }else{
        ll l, r, x;
        cin >> l >> r >> x;
        auto it = t[x].lower_bound(l);
        if(it != t[x].end() && *it <= r){
            cout << *it << ' ' << *it << '\n';
            continue;
        }
        it = s[x].lower_bound(l);
        if(it != s[x].end() && *it < r){
            cout << *it << ' ' << (*it) + 1 << '\n';
            continue;
        }
        cout << "-1 -1\n";
    }
  }
  
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre(N);
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){

        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message (stderr)

treearray.cpp: In function 'int main()':
treearray.cpp:162:15: warning: unused variable 'CT' [-Wunused-variable]
  162 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

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