oj.uz

Submission #495843

# Submission time Handle Problem Language Result Execution time Memory
495843 2021-12-20T06:09:20 Z xynex Birthday gift (IZhO18_treearray) C++17
100 / 100
 1095 ms 92596 KB 
/*
* Author: xynex
* Created: 20.12.2021 10:40
* Why am I so stupid? :c
* Slishkom slab
*/

#include <bits/stdc++.h>

// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
    random_device rd;
    mt19937 gen(rd());
    return uniform_int_distribution<T>(l, r)(gen);
}

template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

void precalc() {

}

vt<int> g[N];
int tin[N], tout[N], timer, LOG;
int up[N][30];

void dfs(int v, int p) {
    tin[v] = ++timer;
    up[v][0] = p;
    for (int i = 1; i <= LOG; ++i) up[v][i] = up[up[v][i-1]][i-1];
    for (int to : g[v]) {
        if (to == p) continue;
        dfs(to, v);
    }
    tout[v] = ++timer;
}

bool is_ancestor(int u, int v) {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}

int lca(int u, int v) {
    if(is_ancestor(u, v)) return u;
    if(is_ancestor(v, u)) return v;
    for(int i = LOG; i >= 0; --i) {
        if(!is_ancestor(up[u][i], v)) u = up[u][i];
    }
    return up[u][0];
}
int a[N];
multiset<int> whr[N], lcacontainer[N];
void solve() {
    int n, m, q; read(n, m, q);
    LOG = ceil(log2(n));
    //print(LOG);
    for(int i = 1; i < n; ++i) {
        int l, r; read(l, r);
        l--, r--;
        g[l].pb(r);
        g[r].pb(l);
    }
    dfs(0, 0);
    for(int i = 1; i <= m; ++i) read(a[i]), a[i]--, whr[a[i]].insert(i);
    for(int i = 1; i < m; ++i) {
        int cur = lca(a[i], a[i + 1]);
        //print(cur, i);
        lcacontainer[cur].insert(i);
    }
    while(q--) {
        int type; read(type);
        if(type == 1) {
            int pos, ind; read(pos, ind);
            ind--;
            if(pos != 1) lcacontainer[lca(a[pos - 1], a[pos])].erase(pos - 1);
            if(pos < m) lcacontainer[lca(a[pos], a[pos + 1])].erase(pos);
            whr[a[pos]].erase(pos);
            a[pos] = ind;
            if(pos != 1) lcacontainer[lca(a[pos - 1], a[pos])].insert(pos - 1);
            if(pos < m) lcacontainer[lca(a[pos], a[pos + 1])].insert(pos);
            whr[a[pos]].insert(pos);
        }
        else {
            int l, r, ind; read(l, r, ind);
            ind--;
            auto finded = whr[ind].lower_bound(l);
            if(finded != whr[ind].end() && (*finded) <= r && (*finded) >= l) {
                print(*finded, *finded);
                continue;
            }
            finded = lcacontainer[ind].lower_bound(l);
            //print(*finded);
            if(finded != whr[ind].end() && *finded <= (r - 1) && *finded >= l) {
                print(*finded, *finded + 1);
                continue;
            }
            print(-1, -1);
        }
    }
}

int main() {
    //freop("");
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //read(t);
    precalc();
    for (int i = 1; i <= t; ++i) {
        //write("Case #" + to_string(i) + ": ");
        solve();
    }
    return 0;
}

Compilation message

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

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23696 KB n=5
2 Correct 14 ms 23840 KB n=100
3 Correct 14 ms 23844 KB n=100
4 Correct 16 ms 23828 KB n=100
5 Correct 13 ms 23756 KB n=100
6 Correct 12 ms 23756 KB n=100
7 Correct 13 ms 23756 KB n=100
8 Correct 13 ms 23756 KB n=100
9 Correct 13 ms 23840 KB n=100
10 Correct 14 ms 23756 KB n=100
11 Correct 13 ms 23840 KB n=100
12 Correct 17 ms 23772 KB n=100
13 Correct 16 ms 23796 KB n=100
14 Correct 14 ms 23744 KB n=100
15 Correct 13 ms 23848 KB n=100
16 Correct 15 ms 23840 KB n=100
17 Correct 12 ms 23756 KB n=100
18 Correct 12 ms 23756 KB n=100
19 Correct 12 ms 23764 KB n=100
20 Correct 13 ms 23804 KB n=100
21 Correct 13 ms 23756 KB n=100
22 Correct 12 ms 23764 KB n=100
23 Correct 13 ms 23756 KB n=100
24 Correct 17 ms 23752 KB n=100
25 Correct 12 ms 23756 KB n=100
26 Correct 12 ms 23756 KB n=12
27 Correct 13 ms 23756 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23696 KB n=5
2 Correct 14 ms 23840 KB n=100
3 Correct 14 ms 23844 KB n=100
4 Correct 16 ms 23828 KB n=100
5 Correct 13 ms 23756 KB n=100
6 Correct 12 ms 23756 KB n=100
7 Correct 13 ms 23756 KB n=100
8 Correct 13 ms 23756 KB n=100
9 Correct 13 ms 23840 KB n=100
10 Correct 14 ms 23756 KB n=100
11 Correct 13 ms 23840 KB n=100
12 Correct 17 ms 23772 KB n=100
13 Correct 16 ms 23796 KB n=100
14 Correct 14 ms 23744 KB n=100
15 Correct 13 ms 23848 KB n=100
16 Correct 15 ms 23840 KB n=100
17 Correct 12 ms 23756 KB n=100
18 Correct 12 ms 23756 KB n=100
19 Correct 12 ms 23764 KB n=100
20 Correct 13 ms 23804 KB n=100
21 Correct 13 ms 23756 KB n=100
22 Correct 12 ms 23764 KB n=100
23 Correct 13 ms 23756 KB n=100
24 Correct 17 ms 23752 KB n=100
25 Correct 12 ms 23756 KB n=100
26 Correct 12 ms 23756 KB n=12
27 Correct 13 ms 23756 KB n=100
28 Correct 14 ms 23884 KB n=500
29 Correct 16 ms 23872 KB n=500
30 Correct 18 ms 23956 KB n=500
31 Correct 13 ms 23884 KB n=500
32 Correct 13 ms 23884 KB n=500
33 Correct 15 ms 23884 KB n=500
34 Correct 16 ms 24044 KB n=500
35 Correct 17 ms 23880 KB n=500
36 Correct 16 ms 23884 KB n=500
37 Correct 14 ms 23932 KB n=500
38 Correct 12 ms 23884 KB n=500
39 Correct 14 ms 23884 KB n=500
40 Correct 14 ms 23884 KB n=500
41 Correct 14 ms 23864 KB n=500
42 Correct 16 ms 23884 KB n=500
43 Correct 16 ms 23952 KB n=500
44 Correct 15 ms 23844 KB n=500
45 Correct 13 ms 23956 KB n=500
46 Correct 14 ms 23944 KB n=500
47 Correct 14 ms 23884 KB n=500
48 Correct 14 ms 23944 KB n=500
49 Correct 14 ms 23956 KB n=500
50 Correct 15 ms 23844 KB n=500
51 Correct 19 ms 23952 KB n=500
52 Correct 15 ms 23884 KB n=500
53 Correct 15 ms 23884 KB n=500
54 Correct 13 ms 23968 KB n=500
55 Correct 14 ms 24012 KB n=278
56 Correct 13 ms 23892 KB n=500
57 Correct 13 ms 23884 KB n=500
58 Correct 13 ms 23884 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23696 KB n=5
2 Correct 14 ms 23840 KB n=100
3 Correct 14 ms 23844 KB n=100
4 Correct 16 ms 23828 KB n=100
5 Correct 13 ms 23756 KB n=100
6 Correct 12 ms 23756 KB n=100
7 Correct 13 ms 23756 KB n=100
8 Correct 13 ms 23756 KB n=100
9 Correct 13 ms 23840 KB n=100
10 Correct 14 ms 23756 KB n=100
11 Correct 13 ms 23840 KB n=100
12 Correct 17 ms 23772 KB n=100
13 Correct 16 ms 23796 KB n=100
14 Correct 14 ms 23744 KB n=100
15 Correct 13 ms 23848 KB n=100
16 Correct 15 ms 23840 KB n=100
17 Correct 12 ms 23756 KB n=100
18 Correct 12 ms 23756 KB n=100
19 Correct 12 ms 23764 KB n=100
20 Correct 13 ms 23804 KB n=100
21 Correct 13 ms 23756 KB n=100
22 Correct 12 ms 23764 KB n=100
23 Correct 13 ms 23756 KB n=100
24 Correct 17 ms 23752 KB n=100
25 Correct 12 ms 23756 KB n=100
26 Correct 12 ms 23756 KB n=12
27 Correct 13 ms 23756 KB n=100
28 Correct 14 ms 23884 KB n=500
29 Correct 16 ms 23872 KB n=500
30 Correct 18 ms 23956 KB n=500
31 Correct 13 ms 23884 KB n=500
32 Correct 13 ms 23884 KB n=500
33 Correct 15 ms 23884 KB n=500
34 Correct 16 ms 24044 KB n=500
35 Correct 17 ms 23880 KB n=500
36 Correct 16 ms 23884 KB n=500
37 Correct 14 ms 23932 KB n=500
38 Correct 12 ms 23884 KB n=500
39 Correct 14 ms 23884 KB n=500
40 Correct 14 ms 23884 KB n=500
41 Correct 14 ms 23864 KB n=500
42 Correct 16 ms 23884 KB n=500
43 Correct 16 ms 23952 KB n=500
44 Correct 15 ms 23844 KB n=500
45 Correct 13 ms 23956 KB n=500
46 Correct 14 ms 23944 KB n=500
47 Correct 14 ms 23884 KB n=500
48 Correct 14 ms 23944 KB n=500
49 Correct 14 ms 23956 KB n=500
50 Correct 15 ms 23844 KB n=500
51 Correct 19 ms 23952 KB n=500
52 Correct 15 ms 23884 KB n=500
53 Correct 15 ms 23884 KB n=500
54 Correct 13 ms 23968 KB n=500
55 Correct 14 ms 24012 KB n=278
56 Correct 13 ms 23892 KB n=500
57 Correct 13 ms 23884 KB n=500
58 Correct 13 ms 23884 KB n=500
59 Correct 20 ms 24340 KB n=2000
60 Correct 16 ms 24392 KB n=2000
61 Correct 18 ms 24396 KB n=2000
62 Correct 16 ms 24316 KB n=2000
63 Correct 16 ms 24268 KB n=2000
64 Correct 18 ms 24376 KB n=2000
65 Correct 20 ms 24268 KB n=2000
66 Correct 15 ms 24348 KB n=2000
67 Correct 15 ms 24268 KB n=2000
68 Correct 15 ms 24268 KB n=2000
69 Correct 14 ms 24320 KB n=2000
70 Correct 15 ms 24268 KB n=2000
71 Correct 20 ms 24296 KB n=2000
72 Correct 15 ms 24268 KB n=2000
73 Correct 16 ms 24300 KB n=2000
74 Correct 14 ms 24312 KB n=1844
75 Correct 16 ms 24360 KB n=2000
76 Correct 18 ms 24268 KB n=2000
77 Correct 21 ms 24236 KB n=2000
78 Correct 15 ms 24268 KB n=2000
79 Correct 16 ms 24320 KB n=2000
80 Correct 17 ms 24316 KB n=2000
81 Correct 15 ms 24268 KB n=2000
82 Correct 16 ms 24268 KB n=2000
83 Correct 15 ms 24396 KB n=2000
84 Correct 18 ms 24268 KB n=2000
85 Correct 16 ms 24268 KB n=2000
86 Correct 16 ms 24268 KB n=2000
87 Correct 16 ms 24268 KB n=2000
88 Correct 14 ms 24344 KB n=2000
89 Correct 15 ms 24360 KB n=2000
90 Correct 16 ms 24396 KB n=2000
91 Correct 15 ms 24268 KB n=2000

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23696 KB n=5
2 Correct 14 ms 23840 KB n=100
3 Correct 14 ms 23844 KB n=100
4 Correct 16 ms 23828 KB n=100
5 Correct 13 ms 23756 KB n=100
6 Correct 12 ms 23756 KB n=100
7 Correct 13 ms 23756 KB n=100
8 Correct 13 ms 23756 KB n=100
9 Correct 13 ms 23840 KB n=100
10 Correct 14 ms 23756 KB n=100
11 Correct 13 ms 23840 KB n=100
12 Correct 17 ms 23772 KB n=100
13 Correct 16 ms 23796 KB n=100
14 Correct 14 ms 23744 KB n=100
15 Correct 13 ms 23848 KB n=100
16 Correct 15 ms 23840 KB n=100
17 Correct 12 ms 23756 KB n=100
18 Correct 12 ms 23756 KB n=100
19 Correct 12 ms 23764 KB n=100
20 Correct 13 ms 23804 KB n=100
21 Correct 13 ms 23756 KB n=100
22 Correct 12 ms 23764 KB n=100
23 Correct 13 ms 23756 KB n=100
24 Correct 17 ms 23752 KB n=100
25 Correct 12 ms 23756 KB n=100
26 Correct 12 ms 23756 KB n=12
27 Correct 13 ms 23756 KB n=100
28 Correct 14 ms 23884 KB n=500
29 Correct 16 ms 23872 KB n=500
30 Correct 18 ms 23956 KB n=500
31 Correct 13 ms 23884 KB n=500
32 Correct 13 ms 23884 KB n=500
33 Correct 15 ms 23884 KB n=500
34 Correct 16 ms 24044 KB n=500
35 Correct 17 ms 23880 KB n=500
36 Correct 16 ms 23884 KB n=500
37 Correct 14 ms 23932 KB n=500
38 Correct 12 ms 23884 KB n=500
39 Correct 14 ms 23884 KB n=500
40 Correct 14 ms 23884 KB n=500
41 Correct 14 ms 23864 KB n=500
42 Correct 16 ms 23884 KB n=500
43 Correct 16 ms 23952 KB n=500
44 Correct 15 ms 23844 KB n=500
45 Correct 13 ms 23956 KB n=500
46 Correct 14 ms 23944 KB n=500
47 Correct 14 ms 23884 KB n=500
48 Correct 14 ms 23944 KB n=500
49 Correct 14 ms 23956 KB n=500
50 Correct 15 ms 23844 KB n=500
51 Correct 19 ms 23952 KB n=500
52 Correct 15 ms 23884 KB n=500
53 Correct 15 ms 23884 KB n=500
54 Correct 13 ms 23968 KB n=500
55 Correct 14 ms 24012 KB n=278
56 Correct 13 ms 23892 KB n=500
57 Correct 13 ms 23884 KB n=500
58 Correct 13 ms 23884 KB n=500
59 Correct 20 ms 24340 KB n=2000
60 Correct 16 ms 24392 KB n=2000
61 Correct 18 ms 24396 KB n=2000
62 Correct 16 ms 24316 KB n=2000
63 Correct 16 ms 24268 KB n=2000
64 Correct 18 ms 24376 KB n=2000
65 Correct 20 ms 24268 KB n=2000
66 Correct 15 ms 24348 KB n=2000
67 Correct 15 ms 24268 KB n=2000
68 Correct 15 ms 24268 KB n=2000
69 Correct 14 ms 24320 KB n=2000
70 Correct 15 ms 24268 KB n=2000
71 Correct 20 ms 24296 KB n=2000
72 Correct 15 ms 24268 KB n=2000
73 Correct 16 ms 24300 KB n=2000
74 Correct 14 ms 24312 KB n=1844
75 Correct 16 ms 24360 KB n=2000
76 Correct 18 ms 24268 KB n=2000
77 Correct 21 ms 24236 KB n=2000
78 Correct 15 ms 24268 KB n=2000
79 Correct 16 ms 24320 KB n=2000
80 Correct 17 ms 24316 KB n=2000
81 Correct 15 ms 24268 KB n=2000
82 Correct 16 ms 24268 KB n=2000
83 Correct 15 ms 24396 KB n=2000
84 Correct 18 ms 24268 KB n=2000
85 Correct 16 ms 24268 KB n=2000
86 Correct 16 ms 24268 KB n=2000
87 Correct 16 ms 24268 KB n=2000
88 Correct 14 ms 24344 KB n=2000
89 Correct 15 ms 24360 KB n=2000
90 Correct 16 ms 24396 KB n=2000
91 Correct 15 ms 24268 KB n=2000
92 Correct 767 ms 76720 KB n=200000
93 Correct 843 ms 83900 KB n=200000
94 Correct 667 ms 91516 KB n=200000
95 Correct 732 ms 83020 KB n=200000
96 Correct 730 ms 82896 KB n=200000
97 Correct 1002 ms 87148 KB n=200000
98 Correct 793 ms 83084 KB n=200000
99 Correct 842 ms 83136 KB n=200000
100 Correct 757 ms 83120 KB n=200000
101 Correct 543 ms 92596 KB n=200000
102 Correct 453 ms 84140 KB n=200000
103 Correct 439 ms 84136 KB n=200000
104 Correct 431 ms 84084 KB n=200000
105 Correct 413 ms 84560 KB n=200000
106 Correct 412 ms 84568 KB n=200000
107 Correct 470 ms 84496 KB n=200000
108 Correct 817 ms 82992 KB n=200000
109 Correct 801 ms 83076 KB n=200000
110 Correct 792 ms 83076 KB n=200000
111 Correct 790 ms 82516 KB n=200000
112 Correct 596 ms 91528 KB n=200000
113 Correct 861 ms 87124 KB n=200000
114 Correct 813 ms 82520 KB n=200000
115 Correct 1095 ms 85012 KB n=200000
116 Correct 725 ms 83040 KB n=200000
117 Correct 576 ms 91928 KB n=200000
118 Correct 949 ms 86028 KB n=200000
119 Correct 715 ms 83120 KB n=200000
120 Correct 511 ms 91640 KB n=200000
121 Correct 472 ms 91616 KB n=200000
122 Correct 506 ms 91796 KB n=200000
123 Correct 479 ms 84352 KB n=200000
124 Correct 170 ms 39884 KB n=25264