oj.uz

Submission #892816

# Submission time Handle Problem Language Result Execution time Memory
892816 2023-12-26T03:20:23 Z vjudge1 Birthday gift (IZhO18_treearray) C++17
0 / 100
 17 ms 7516 KB 
#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 = 2e5+5;
vector<ll> g[N];
ll up[N][18], d[N], 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=17; i>=0; i--) {
        if(k&(1<<i)) x = up[x][i];
    }
    if(x==y) return x;
    for(ll i=17; 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);
    }
    for(ll i=1; i<=m; i++) cin>>a[i];
    dfs(1, 0);
    while(q--) {
        ll type, v, pos, l, r;
        cin>>type;
        if(type==1) {
            cin>>pos>>v;
            a[pos] = v;
        }
        else {
            cin>>l>>r>>v;
            ll L = -1, R = -1;
            for(ll i=l; i<=min(r, l+45); i++) {
                ll x = a[i];
                for(ll j=i; j<=r; j++) {
                    x = lca(x, a[j]);
                    if(x==v) {
                        L = i, R = j;
                        break;
                    }
                }
                if(L>-1) break;
            }
            for(ll i=r; i>=max(l, r-45); i--) {
                if(L>-1) break;
                ll x = a[i];
                for(ll j=i; j>=l; j--) {
                    x = lca(x, a[j]);
                    if(x==v) {
                        L = j, R = i;
                        break;
                    }
                }
                if(L>-1) break;
            }
            cout<<L<<" "<<R<<"\n";
        }
    }
    return;
}

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

Compilation message

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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 KB n=5
2 Correct 3 ms 7512 KB n=100
3 Correct 2 ms 7516 KB n=100
4 Correct 2 ms 7516 KB n=100
5 Correct 2 ms 7512 KB n=100
6 Incorrect 17 ms 7516 KB Jury has the answer but participant has not
7 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 KB n=5
2 Correct 3 ms 7512 KB n=100
3 Correct 2 ms 7516 KB n=100
4 Correct 2 ms 7516 KB n=100
5 Correct 2 ms 7512 KB n=100
6 Incorrect 17 ms 7516 KB Jury has the answer but participant has not
7 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 KB n=5
2 Correct 3 ms 7512 KB n=100
3 Correct 2 ms 7516 KB n=100
4 Correct 2 ms 7516 KB n=100
5 Correct 2 ms 7512 KB n=100
6 Incorrect 17 ms 7516 KB Jury has the answer but participant has not
7 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 KB n=5
2 Correct 3 ms 7512 KB n=100
3 Correct 2 ms 7516 KB n=100
4 Correct 2 ms 7516 KB n=100
5 Correct 2 ms 7512 KB n=100
6 Incorrect 17 ms 7516 KB Jury has the answer but participant has not
7 Halted 0 ms 0 KB -