oj.uz

Submission #54390

# Submission time Handle Problem Language Result Execution time Memory
54390 2018-07-03T09:48:11 Z egorlifar Birthday gift (IZhO18_treearray) C++17
100 / 100
 1491 ms 233844 KB 
/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <iomanip>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define x first
#define y second
const string FILENAME = "input";
const int MAXN = 200228;

//12:00
//17:00
int n, m, q;
vector<int> g[MAXN];
int a[MAXN];
int jump[MAXN][20];
int in[MAXN];
int out[MAXN];
int timer = 0;


void dfs(int u, int pr = -1) {
    timer++;
    in[u] = timer;
    for (auto h: g[u]) {
        if (h != pr) {
            jump[h][0] = u;
            dfs(h, u);
        }
    }
    out[u] = timer;
}


bool is_ancestor(int a, int b) {
    return in[a] <= in[b] && out[b] <= out[a];
}


int lca(int a, int b) {
    if (is_ancestor(a, b)) {
        return a;
    }
    if (is_ancestor(b, a)) {
        return b;
    }
    for (int k = 18; k >= 0; k--) {
        if (!is_ancestor(jump[a][k], b)) {
            a = jump[a][k];
        }
    }
    return jump[a][0];
}


set<int> pos[MAXN];
set<int> kek[MAXN];


void del(int i) {
    pos[a[i]].erase(i);
    if (i) {
        kek[lca(a[i - 1], a[i])].erase(i - 1);
    }
    if (i + 1 < m) {
        kek[lca(a[i], a[i + 1])].erase(i);
    }
}


void add(int i) {
    pos[a[i]].insert(i);
    if (i) {
        kek[lca(a[i - 1], a[i])].insert(i - 1);
    }
    if (i + 1 < m) {
        kek[lca(a[i], a[i + 1])].insert(i);
    }
}


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
    cin >> n >> m >> q;
    for (int i = 0; i < n - 1; i++) {
        int c, d;
        cin >> c >> d;
        c--, d--;
        g[c].pb(d);
        g[d].pb(c);
    }
    dfs(0);
    for (int k = 1; k <= 18; k++) {
        for (int i = 0; i < n; i++) {
            jump[i][k] = jump[jump[i][k - 1]][k - 1];
        }
    }
    for (int i = 0; i < m; i++) {
        cin >> a[i];
        a[i]--;
        pos[a[i]].insert(i);
        if (i) {
            kek[lca(a[i - 1], a[i])].insert(i - 1);
        }
    }
    //return 0;
    for (int it = 0; it < q; it++) {
        int t;
        cin >> t;
        if (t == 1) {
            int id, val;
            cin >> id >> val;
            val--;
            id--;
            del(id);
            a[id] = val;
            add(id);
        } else {
            int l, r, v;
            cin >> l >> r >> v;
            l--, r--, v--;
            auto it = pos[v].lower_bound(l);
            if (it != pos[v].end()) {
                int as = *it;
                if (as <= r) {
                    cout << as + 1 << ' ' << as + 1 << '\n';
                    continue;
                }
            }
            it = kek[v].lower_bound(l);
              if (it != kek[v].end()) {
                int as = *it;
                if (as < r) {
                    cout << as + 1 << ' ' << as + 2 << '\n';
                    continue;
                }
            }
            cout << -1 << ' ' << -1 << '\n';
        }
    }   
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB n=5
2 Correct 23 ms 23912 KB n=100
3 Correct 27 ms 23952 KB n=100
4 Correct 22 ms 23956 KB n=100
5 Correct 23 ms 24068 KB n=100
6 Correct 26 ms 24068 KB n=100
7 Correct 22 ms 24120 KB n=100
8 Correct 23 ms 24124 KB n=100
9 Correct 23 ms 24224 KB n=100
10 Correct 28 ms 24224 KB n=100
11 Correct 23 ms 24224 KB n=100
12 Correct 23 ms 24224 KB n=100
13 Correct 24 ms 24224 KB n=100
14 Correct 22 ms 24224 KB n=100
15 Correct 22 ms 24228 KB n=100
16 Correct 23 ms 24228 KB n=100
17 Correct 21 ms 24240 KB n=100
18 Correct 21 ms 24244 KB n=100
19 Correct 21 ms 24244 KB n=100
20 Correct 21 ms 24248 KB n=100
21 Correct 22 ms 24256 KB n=100
22 Correct 24 ms 24256 KB n=100
23 Correct 23 ms 24260 KB n=100
24 Correct 23 ms 24264 KB n=100
25 Correct 27 ms 24268 KB n=100
26 Correct 22 ms 24272 KB n=12
27 Correct 27 ms 24276 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB n=5
2 Correct 23 ms 23912 KB n=100
3 Correct 27 ms 23952 KB n=100
4 Correct 22 ms 23956 KB n=100
5 Correct 23 ms 24068 KB n=100
6 Correct 26 ms 24068 KB n=100
7 Correct 22 ms 24120 KB n=100
8 Correct 23 ms 24124 KB n=100
9 Correct 23 ms 24224 KB n=100
10 Correct 28 ms 24224 KB n=100
11 Correct 23 ms 24224 KB n=100
12 Correct 23 ms 24224 KB n=100
13 Correct 24 ms 24224 KB n=100
14 Correct 22 ms 24224 KB n=100
15 Correct 22 ms 24228 KB n=100
16 Correct 23 ms 24228 KB n=100
17 Correct 21 ms 24240 KB n=100
18 Correct 21 ms 24244 KB n=100
19 Correct 21 ms 24244 KB n=100
20 Correct 21 ms 24248 KB n=100
21 Correct 22 ms 24256 KB n=100
22 Correct 24 ms 24256 KB n=100
23 Correct 23 ms 24260 KB n=100
24 Correct 23 ms 24264 KB n=100
25 Correct 27 ms 24268 KB n=100
26 Correct 22 ms 24272 KB n=12
27 Correct 27 ms 24276 KB n=100
28 Correct 24 ms 24280 KB n=500
29 Correct 23 ms 24420 KB n=500
30 Correct 26 ms 24452 KB n=500
31 Correct 28 ms 24480 KB n=500
32 Correct 27 ms 24480 KB n=500
33 Correct 23 ms 24512 KB n=500
34 Correct 22 ms 24512 KB n=500
35 Correct 22 ms 24552 KB n=500
36 Correct 23 ms 24552 KB n=500
37 Correct 22 ms 24552 KB n=500
38 Correct 22 ms 24552 KB n=500
39 Correct 24 ms 24552 KB n=500
40 Correct 21 ms 24552 KB n=500
41 Correct 24 ms 24552 KB n=500
42 Correct 22 ms 24552 KB n=500
43 Correct 26 ms 24556 KB n=500
44 Correct 23 ms 24676 KB n=500
45 Correct 22 ms 24676 KB n=500
46 Correct 23 ms 24720 KB n=500
47 Correct 22 ms 24736 KB n=500
48 Correct 24 ms 24736 KB n=500
49 Correct 24 ms 24736 KB n=500
50 Correct 23 ms 24736 KB n=500
51 Correct 23 ms 24736 KB n=500
52 Correct 23 ms 24808 KB n=500
53 Correct 22 ms 24808 KB n=500
54 Correct 23 ms 24840 KB n=500
55 Correct 30 ms 24840 KB n=278
56 Correct 22 ms 24860 KB n=500
57 Correct 25 ms 24860 KB n=500
58 Correct 22 ms 24860 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB n=5
2 Correct 23 ms 23912 KB n=100
3 Correct 27 ms 23952 KB n=100
4 Correct 22 ms 23956 KB n=100
5 Correct 23 ms 24068 KB n=100
6 Correct 26 ms 24068 KB n=100
7 Correct 22 ms 24120 KB n=100
8 Correct 23 ms 24124 KB n=100
9 Correct 23 ms 24224 KB n=100
10 Correct 28 ms 24224 KB n=100
11 Correct 23 ms 24224 KB n=100
12 Correct 23 ms 24224 KB n=100
13 Correct 24 ms 24224 KB n=100
14 Correct 22 ms 24224 KB n=100
15 Correct 22 ms 24228 KB n=100
16 Correct 23 ms 24228 KB n=100
17 Correct 21 ms 24240 KB n=100
18 Correct 21 ms 24244 KB n=100
19 Correct 21 ms 24244 KB n=100
20 Correct 21 ms 24248 KB n=100
21 Correct 22 ms 24256 KB n=100
22 Correct 24 ms 24256 KB n=100
23 Correct 23 ms 24260 KB n=100
24 Correct 23 ms 24264 KB n=100
25 Correct 27 ms 24268 KB n=100
26 Correct 22 ms 24272 KB n=12
27 Correct 27 ms 24276 KB n=100
28 Correct 24 ms 24280 KB n=500
29 Correct 23 ms 24420 KB n=500
30 Correct 26 ms 24452 KB n=500
31 Correct 28 ms 24480 KB n=500
32 Correct 27 ms 24480 KB n=500
33 Correct 23 ms 24512 KB n=500
34 Correct 22 ms 24512 KB n=500
35 Correct 22 ms 24552 KB n=500
36 Correct 23 ms 24552 KB n=500
37 Correct 22 ms 24552 KB n=500
38 Correct 22 ms 24552 KB n=500
39 Correct 24 ms 24552 KB n=500
40 Correct 21 ms 24552 KB n=500
41 Correct 24 ms 24552 KB n=500
42 Correct 22 ms 24552 KB n=500
43 Correct 26 ms 24556 KB n=500
44 Correct 23 ms 24676 KB n=500
45 Correct 22 ms 24676 KB n=500
46 Correct 23 ms 24720 KB n=500
47 Correct 22 ms 24736 KB n=500
48 Correct 24 ms 24736 KB n=500
49 Correct 24 ms 24736 KB n=500
50 Correct 23 ms 24736 KB n=500
51 Correct 23 ms 24736 KB n=500
52 Correct 23 ms 24808 KB n=500
53 Correct 22 ms 24808 KB n=500
54 Correct 23 ms 24840 KB n=500
55 Correct 30 ms 24840 KB n=278
56 Correct 22 ms 24860 KB n=500
57 Correct 25 ms 24860 KB n=500
58 Correct 22 ms 24860 KB n=500
59 Correct 26 ms 25160 KB n=2000
60 Correct 26 ms 25340 KB n=2000
61 Correct 26 ms 25396 KB n=2000
62 Correct 26 ms 25396 KB n=2000
63 Correct 26 ms 25396 KB n=2000
64 Correct 27 ms 25560 KB n=2000
65 Correct 28 ms 25584 KB n=2000
66 Correct 31 ms 25668 KB n=2000
67 Correct 27 ms 25668 KB n=2000
68 Correct 27 ms 25780 KB n=2000
69 Correct 26 ms 25780 KB n=2000
70 Correct 24 ms 25824 KB n=2000
71 Correct 32 ms 25824 KB n=2000
72 Correct 33 ms 25868 KB n=2000
73 Correct 26 ms 25924 KB n=2000
74 Correct 27 ms 25984 KB n=1844
75 Correct 25 ms 26028 KB n=2000
76 Correct 26 ms 26080 KB n=2000
77 Correct 31 ms 26132 KB n=2000
78 Correct 29 ms 26184 KB n=2000
79 Correct 35 ms 26296 KB n=2000
80 Correct 32 ms 26416 KB n=2000
81 Correct 26 ms 26476 KB n=2000
82 Correct 34 ms 26476 KB n=2000
83 Correct 26 ms 26576 KB n=2000
84 Correct 27 ms 26576 KB n=2000
85 Correct 27 ms 26684 KB n=2000
86 Correct 26 ms 26684 KB n=2000
87 Correct 29 ms 26684 KB n=2000
88 Correct 28 ms 26844 KB n=2000
89 Correct 27 ms 26904 KB n=2000
90 Correct 30 ms 26960 KB n=2000
91 Correct 28 ms 26968 KB n=2000

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB n=5
2 Correct 23 ms 23912 KB n=100
3 Correct 27 ms 23952 KB n=100
4 Correct 22 ms 23956 KB n=100
5 Correct 23 ms 24068 KB n=100
6 Correct 26 ms 24068 KB n=100
7 Correct 22 ms 24120 KB n=100
8 Correct 23 ms 24124 KB n=100
9 Correct 23 ms 24224 KB n=100
10 Correct 28 ms 24224 KB n=100
11 Correct 23 ms 24224 KB n=100
12 Correct 23 ms 24224 KB n=100
13 Correct 24 ms 24224 KB n=100
14 Correct 22 ms 24224 KB n=100
15 Correct 22 ms 24228 KB n=100
16 Correct 23 ms 24228 KB n=100
17 Correct 21 ms 24240 KB n=100
18 Correct 21 ms 24244 KB n=100
19 Correct 21 ms 24244 KB n=100
20 Correct 21 ms 24248 KB n=100
21 Correct 22 ms 24256 KB n=100
22 Correct 24 ms 24256 KB n=100
23 Correct 23 ms 24260 KB n=100
24 Correct 23 ms 24264 KB n=100
25 Correct 27 ms 24268 KB n=100
26 Correct 22 ms 24272 KB n=12
27 Correct 27 ms 24276 KB n=100
28 Correct 24 ms 24280 KB n=500
29 Correct 23 ms 24420 KB n=500
30 Correct 26 ms 24452 KB n=500
31 Correct 28 ms 24480 KB n=500
32 Correct 27 ms 24480 KB n=500
33 Correct 23 ms 24512 KB n=500
34 Correct 22 ms 24512 KB n=500
35 Correct 22 ms 24552 KB n=500
36 Correct 23 ms 24552 KB n=500
37 Correct 22 ms 24552 KB n=500
38 Correct 22 ms 24552 KB n=500
39 Correct 24 ms 24552 KB n=500
40 Correct 21 ms 24552 KB n=500
41 Correct 24 ms 24552 KB n=500
42 Correct 22 ms 24552 KB n=500
43 Correct 26 ms 24556 KB n=500
44 Correct 23 ms 24676 KB n=500
45 Correct 22 ms 24676 KB n=500
46 Correct 23 ms 24720 KB n=500
47 Correct 22 ms 24736 KB n=500
48 Correct 24 ms 24736 KB n=500
49 Correct 24 ms 24736 KB n=500
50 Correct 23 ms 24736 KB n=500
51 Correct 23 ms 24736 KB n=500
52 Correct 23 ms 24808 KB n=500
53 Correct 22 ms 24808 KB n=500
54 Correct 23 ms 24840 KB n=500
55 Correct 30 ms 24840 KB n=278
56 Correct 22 ms 24860 KB n=500
57 Correct 25 ms 24860 KB n=500
58 Correct 22 ms 24860 KB n=500
59 Correct 26 ms 25160 KB n=2000
60 Correct 26 ms 25340 KB n=2000
61 Correct 26 ms 25396 KB n=2000
62 Correct 26 ms 25396 KB n=2000
63 Correct 26 ms 25396 KB n=2000
64 Correct 27 ms 25560 KB n=2000
65 Correct 28 ms 25584 KB n=2000
66 Correct 31 ms 25668 KB n=2000
67 Correct 27 ms 25668 KB n=2000
68 Correct 27 ms 25780 KB n=2000
69 Correct 26 ms 25780 KB n=2000
70 Correct 24 ms 25824 KB n=2000
71 Correct 32 ms 25824 KB n=2000
72 Correct 33 ms 25868 KB n=2000
73 Correct 26 ms 25924 KB n=2000
74 Correct 27 ms 25984 KB n=1844
75 Correct 25 ms 26028 KB n=2000
76 Correct 26 ms 26080 KB n=2000
77 Correct 31 ms 26132 KB n=2000
78 Correct 29 ms 26184 KB n=2000
79 Correct 35 ms 26296 KB n=2000
80 Correct 32 ms 26416 KB n=2000
81 Correct 26 ms 26476 KB n=2000
82 Correct 34 ms 26476 KB n=2000
83 Correct 26 ms 26576 KB n=2000
84 Correct 27 ms 26576 KB n=2000
85 Correct 27 ms 26684 KB n=2000
86 Correct 26 ms 26684 KB n=2000
87 Correct 29 ms 26684 KB n=2000
88 Correct 28 ms 26844 KB n=2000
89 Correct 27 ms 26904 KB n=2000
90 Correct 30 ms 26960 KB n=2000
91 Correct 28 ms 26968 KB n=2000
92 Correct 1104 ms 78056 KB n=200000
93 Correct 1464 ms 89556 KB n=200000
94 Correct 865 ms 100536 KB n=200000
95 Correct 1101 ms 100536 KB n=200000
96 Correct 994 ms 106116 KB n=200000
97 Correct 1267 ms 116884 KB n=200000
98 Correct 1107 ms 120372 KB n=200000
99 Correct 1310 ms 126956 KB n=200000
100 Correct 1075 ms 134020 KB n=200000
101 Correct 888 ms 150240 KB n=200000
102 Correct 595 ms 150240 KB n=200000
103 Correct 602 ms 155936 KB n=200000
104 Correct 644 ms 162636 KB n=200000
105 Correct 718 ms 169680 KB n=200000
106 Correct 600 ms 177184 KB n=200000
107 Correct 574 ms 184492 KB n=200000
108 Correct 1140 ms 190404 KB n=200000
109 Correct 1229 ms 197256 KB n=200000
110 Correct 1158 ms 204168 KB n=200000
111 Correct 1111 ms 204408 KB n=200000
112 Correct 838 ms 211952 KB n=200000
113 Correct 1299 ms 211952 KB n=200000
114 Correct 1014 ms 211952 KB n=200000
115 Correct 1491 ms 211952 KB n=200000
116 Correct 1058 ms 211952 KB n=200000
117 Correct 815 ms 212184 KB n=200000
118 Correct 1420 ms 212184 KB n=200000
119 Correct 981 ms 212184 KB n=200000
120 Correct 745 ms 219508 KB n=200000
121 Correct 746 ms 226656 KB n=200000
122 Correct 739 ms 233844 KB n=200000
123 Correct 644 ms 233844 KB n=200000
124 Correct 265 ms 233844 KB n=25264