제출 #893842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
893842		kigash	Birthday gift (IZhO18_treearray)	C++17	100 / 100	1092 ms	112408 KiB

treearray

#include "bits/stdc++.h"
using namespace std;       

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }

const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 3e5+5;
vector<ll> g[N];
set<ll> st[N], t[N];
ll d[N], up[N][20], a[N];

void dfs(ll v, ll p) {
    d[v] = d[p]+1, up[v][0] = p;
    for(ll i=1; i<=18; i++) up[v][i] = up[up[v][i-1]][i-1];
    for(auto to: g[v]) {
        if(to==p) continue;
        dfs(to, v);
    }
}

ll lca(ll x, ll y) {
    if(d[x]<d[y]) swap(x, y);
    ll k = d[x]-d[y];
    for(ll i=18; i>=0; i--) {
        if(k&(1<<i)) x = up[x][i];
    }
    if(x==y) return x;
    for(ll i=18; i>=0; i--) {
        if(up[x][i]!=up[y][i]) {
            x = up[x][i];
            y = up[y][i];
        }
    }
    return up[x][0];
}

void kigash() {
    ll n, m, q;
    cin>>n>>m>>q;
    for(ll i=1; i<n; i++) {
        ll u, v;
        cin>>u>>v;
        g[u].pb(v), g[v].pb(u);
    }
    dfs(1, 0);
    for(ll i=1; i<=m; i++) {
        cin>>a[i];
        t[a[i]].insert(i);
        if(i>1) st[lca(a[i], a[i-1])].insert(i-1);
    }
    while(q--) {
        ll type, pos, v, l, r;
        cin>>type;
        if(type==1) {
            cin>>pos>>v;
            t[a[pos]].erase(pos);
            st[lca(a[pos], a[pos-1])].erase(pos-1);
            st[lca(a[pos+1], a[pos])].erase(pos);
            a[pos] = v;
            t[a[pos]].insert(pos);
            st[lca(a[pos], a[pos-1])].insert(pos-1);
            st[lca(a[pos+1], a[pos])].insert(pos);
        }
        else {
            cin>>l>>r>>v;
            auto it = t[v].lower_bound(l);
            if(it!=t[v].end() && (*it)<=r) cout<<(*it)<<" "<<(*it)<<"\n";
            else {
                auto it = st[v].lower_bound(l);
                if(it!=st[v].end() && (*it)<r) cout<<(*it)<<" "<<(*it)+1<<"\n";
                else cout<<"-1 -1\n";
            }
        }
    }
    return;
}

signed main(/*Kigash Amir*/) {
    // freopen("");
    IOIGold2024_InshAllah();
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        kigash();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

treearray.cpp: In function 'void freopen(std::string)':
treearray.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
treearray.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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