oj.uz

Submission #500842

# Submission time Handle Problem Language Result Execution time Memory
500842 2022-01-01T12:06:29 Z pragmatist Birthday gift (IZhO18_treearray) C++17
56 / 100
 4000 ms 55380 KB 
#include <bits/stdc++.h>                            
 
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define x first
#define y second
#define int long long
#define nl "\n"
 
using namespace std;

typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair <ll, ll> pii;

const int N = (int)2e5 + 7;
const int M = (int)7e6 + 7;
const ll MOD = (ll)1e9 + 7;                    
const int inf = (int)1e9 + 7;
const ll INF = (ll)3e18 + 7;

pii dir[] = {{-1, -1}, {1, 1}, {-1, 1}, {1, -1}};

int n, m, q, a[N], t[4*N], leaf;
int timer, tin[N], tout[N], up[N][19];
vector<int> g[N];

void calc(int v, int pr) {
	up[v][0] = pr;
	tin[v] = ++timer;
	for(int i = 1; i <= 18; ++i) {
		up[v][i] = up[up[v][i-1]][i-1];
	}
	for(auto to : g[v]) {
		if(to != pr) {
			calc(to, v);
		}
	}	
	tout[v] = ++timer;
}

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

int lca(int u, int v) {
	if(u == -1) return v;
	if(v == -1) return u;
	if(is_parent(u, v)) return u;
	if(is_parent(v, u)) return v;
	for(int i = 18; i >= 0; --i) {
		if(!is_parent(up[u][i], v)) {
			u = up[u][i];
		}
	}
	return up[u][0];
}

void solve() { 
	cin >> n >> m >> q;
	for(int i = 1; i < n; ++i) {
		int u, v;
		cin >> u >> v;
		g[u].pb(v);
		g[v].pb(u);
	}
	for(int i = 1; i <= m; ++i) cin >> a[i];
	calc(1, 1);
	while(q--) {
		char tp;
		cin >> tp;
		int l, r, v;
		if(tp == '1') {
			cin >> l >> r;
			a[l] = r;
		} else {
			cin >> l >> r >> v;
			int x = -1, y = -1;
			for(int i = l; i < r; ++i) {
				if(lca(a[i], a[i + 1]) == v) {
					x = i, y = i+1;
					break;
				}
				if(a[i] == v) {
					x = y = i;
					break;
				}
			}
			if(a[r] == v) x = y = r;
			cout << x << ' ' << y << nl;
		}
	} 	
}

signed main() {                   
	ios_base::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);
   	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
        //cout << "Case " << i << ": ";
        solve();
    }
    return 0;
}
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB n=5
2 Correct 3 ms 5068 KB n=100
3 Correct 3 ms 5068 KB n=100
4 Correct 3 ms 5068 KB n=100
5 Correct 4 ms 5020 KB n=100
6 Correct 5 ms 5016 KB n=100
7 Correct 4 ms 5068 KB n=100
8 Correct 3 ms 5068 KB n=100
9 Correct 3 ms 5068 KB n=100
10 Correct 3 ms 5068 KB n=100
11 Correct 3 ms 5068 KB n=100
12 Correct 3 ms 5068 KB n=100
13 Correct 2 ms 5068 KB n=100
14 Correct 2 ms 5068 KB n=100
15 Correct 3 ms 5068 KB n=100
16 Correct 3 ms 5004 KB n=100
17 Correct 2 ms 5068 KB n=100
18 Correct 2 ms 5068 KB n=100
19 Correct 3 ms 5068 KB n=100
20 Correct 3 ms 5068 KB n=100
21 Correct 3 ms 5068 KB n=100
22 Correct 3 ms 5068 KB n=100
23 Correct 3 ms 5020 KB n=100
24 Correct 2 ms 5068 KB n=100
25 Correct 3 ms 5068 KB n=100
26 Correct 3 ms 4940 KB n=12
27 Correct 3 ms 5068 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB n=5
2 Correct 3 ms 5068 KB n=100
3 Correct 3 ms 5068 KB n=100
4 Correct 3 ms 5068 KB n=100
5 Correct 4 ms 5020 KB n=100
6 Correct 5 ms 5016 KB n=100
7 Correct 4 ms 5068 KB n=100
8 Correct 3 ms 5068 KB n=100
9 Correct 3 ms 5068 KB n=100
10 Correct 3 ms 5068 KB n=100
11 Correct 3 ms 5068 KB n=100
12 Correct 3 ms 5068 KB n=100
13 Correct 2 ms 5068 KB n=100
14 Correct 2 ms 5068 KB n=100
15 Correct 3 ms 5068 KB n=100
16 Correct 3 ms 5004 KB n=100
17 Correct 2 ms 5068 KB n=100
18 Correct 2 ms 5068 KB n=100
19 Correct 3 ms 5068 KB n=100
20 Correct 3 ms 5068 KB n=100
21 Correct 3 ms 5068 KB n=100
22 Correct 3 ms 5068 KB n=100
23 Correct 3 ms 5020 KB n=100
24 Correct 2 ms 5068 KB n=100
25 Correct 3 ms 5068 KB n=100
26 Correct 3 ms 4940 KB n=12
27 Correct 3 ms 5068 KB n=100
28 Correct 3 ms 5068 KB n=500
29 Correct 3 ms 5068 KB n=500
30 Correct 5 ms 5068 KB n=500
31 Correct 4 ms 5068 KB n=500
32 Correct 3 ms 5068 KB n=500
33 Correct 4 ms 5160 KB n=500
34 Correct 3 ms 5068 KB n=500
35 Correct 3 ms 5196 KB n=500
36 Correct 17 ms 5156 KB n=500
37 Correct 19 ms 5060 KB n=500
38 Correct 16 ms 5176 KB n=500
39 Correct 12 ms 5176 KB n=500
40 Correct 12 ms 5068 KB n=500
41 Correct 9 ms 5068 KB n=500
42 Correct 10 ms 5068 KB n=500
43 Correct 11 ms 5068 KB n=500
44 Correct 9 ms 5068 KB n=500
45 Correct 3 ms 5068 KB n=500
46 Correct 3 ms 5068 KB n=500
47 Correct 3 ms 5168 KB n=500
48 Correct 3 ms 5068 KB n=500
49 Correct 3 ms 5068 KB n=500
50 Correct 9 ms 5156 KB n=500
51 Correct 5 ms 5160 KB n=500
52 Correct 4 ms 5068 KB n=500
53 Correct 7 ms 5068 KB n=500
54 Correct 3 ms 5068 KB n=500
55 Correct 3 ms 5068 KB n=278
56 Correct 3 ms 5068 KB n=500
57 Correct 3 ms 5068 KB n=500
58 Correct 15 ms 5068 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB n=5
2 Correct 3 ms 5068 KB n=100
3 Correct 3 ms 5068 KB n=100
4 Correct 3 ms 5068 KB n=100
5 Correct 4 ms 5020 KB n=100
6 Correct 5 ms 5016 KB n=100
7 Correct 4 ms 5068 KB n=100
8 Correct 3 ms 5068 KB n=100
9 Correct 3 ms 5068 KB n=100
10 Correct 3 ms 5068 KB n=100
11 Correct 3 ms 5068 KB n=100
12 Correct 3 ms 5068 KB n=100
13 Correct 2 ms 5068 KB n=100
14 Correct 2 ms 5068 KB n=100
15 Correct 3 ms 5068 KB n=100
16 Correct 3 ms 5004 KB n=100
17 Correct 2 ms 5068 KB n=100
18 Correct 2 ms 5068 KB n=100
19 Correct 3 ms 5068 KB n=100
20 Correct 3 ms 5068 KB n=100
21 Correct 3 ms 5068 KB n=100
22 Correct 3 ms 5068 KB n=100
23 Correct 3 ms 5020 KB n=100
24 Correct 2 ms 5068 KB n=100
25 Correct 3 ms 5068 KB n=100
26 Correct 3 ms 4940 KB n=12
27 Correct 3 ms 5068 KB n=100
28 Correct 3 ms 5068 KB n=500
29 Correct 3 ms 5068 KB n=500
30 Correct 5 ms 5068 KB n=500
31 Correct 4 ms 5068 KB n=500
32 Correct 3 ms 5068 KB n=500
33 Correct 4 ms 5160 KB n=500
34 Correct 3 ms 5068 KB n=500
35 Correct 3 ms 5196 KB n=500
36 Correct 17 ms 5156 KB n=500
37 Correct 19 ms 5060 KB n=500
38 Correct 16 ms 5176 KB n=500
39 Correct 12 ms 5176 KB n=500
40 Correct 12 ms 5068 KB n=500
41 Correct 9 ms 5068 KB n=500
42 Correct 10 ms 5068 KB n=500
43 Correct 11 ms 5068 KB n=500
44 Correct 9 ms 5068 KB n=500
45 Correct 3 ms 5068 KB n=500
46 Correct 3 ms 5068 KB n=500
47 Correct 3 ms 5168 KB n=500
48 Correct 3 ms 5068 KB n=500
49 Correct 3 ms 5068 KB n=500
50 Correct 9 ms 5156 KB n=500
51 Correct 5 ms 5160 KB n=500
52 Correct 4 ms 5068 KB n=500
53 Correct 7 ms 5068 KB n=500
54 Correct 3 ms 5068 KB n=500
55 Correct 3 ms 5068 KB n=278
56 Correct 3 ms 5068 KB n=500
57 Correct 3 ms 5068 KB n=500
58 Correct 15 ms 5068 KB n=500
59 Correct 4 ms 5452 KB n=2000
60 Correct 7 ms 5580 KB n=2000
61 Correct 22 ms 5580 KB n=2000
62 Correct 23 ms 5544 KB n=2000
63 Correct 6 ms 5452 KB n=2000
64 Correct 22 ms 5552 KB n=2000
65 Correct 4 ms 5420 KB n=2000
66 Correct 14 ms 5584 KB n=2000
67 Correct 6 ms 5452 KB n=2000
68 Correct 21 ms 5564 KB n=2000
69 Correct 244 ms 5516 KB n=2000
70 Correct 236 ms 5520 KB n=2000
71 Correct 228 ms 5504 KB n=2000
72 Correct 128 ms 5632 KB n=2000
73 Correct 122 ms 5644 KB n=2000
74 Correct 4 ms 5424 KB n=1844
75 Correct 121 ms 5528 KB n=2000
76 Correct 132 ms 5508 KB n=2000
77 Correct 131 ms 5504 KB n=2000
78 Correct 124 ms 5516 KB n=2000
79 Correct 4 ms 5452 KB n=2000
80 Correct 11 ms 5548 KB n=2000
81 Correct 18 ms 5556 KB n=2000
82 Correct 4 ms 5452 KB n=2000
83 Correct 14 ms 5548 KB n=2000
84 Correct 75 ms 5520 KB n=2000
85 Correct 44 ms 5620 KB n=2000
86 Correct 50 ms 5532 KB n=2000
87 Correct 71 ms 5520 KB n=2000
88 Correct 25 ms 5548 KB n=2000
89 Correct 18 ms 5608 KB n=2000
90 Correct 11 ms 5604 KB n=2000
91 Correct 173 ms 5528 KB n=2000

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB n=5
2 Correct 3 ms 5068 KB n=100
3 Correct 3 ms 5068 KB n=100
4 Correct 3 ms 5068 KB n=100
5 Correct 4 ms 5020 KB n=100
6 Correct 5 ms 5016 KB n=100
7 Correct 4 ms 5068 KB n=100
8 Correct 3 ms 5068 KB n=100
9 Correct 3 ms 5068 KB n=100
10 Correct 3 ms 5068 KB n=100
11 Correct 3 ms 5068 KB n=100
12 Correct 3 ms 5068 KB n=100
13 Correct 2 ms 5068 KB n=100
14 Correct 2 ms 5068 KB n=100
15 Correct 3 ms 5068 KB n=100
16 Correct 3 ms 5004 KB n=100
17 Correct 2 ms 5068 KB n=100
18 Correct 2 ms 5068 KB n=100
19 Correct 3 ms 5068 KB n=100
20 Correct 3 ms 5068 KB n=100
21 Correct 3 ms 5068 KB n=100
22 Correct 3 ms 5068 KB n=100
23 Correct 3 ms 5020 KB n=100
24 Correct 2 ms 5068 KB n=100
25 Correct 3 ms 5068 KB n=100
26 Correct 3 ms 4940 KB n=12
27 Correct 3 ms 5068 KB n=100
28 Correct 3 ms 5068 KB n=500
29 Correct 3 ms 5068 KB n=500
30 Correct 5 ms 5068 KB n=500
31 Correct 4 ms 5068 KB n=500
32 Correct 3 ms 5068 KB n=500
33 Correct 4 ms 5160 KB n=500
34 Correct 3 ms 5068 KB n=500
35 Correct 3 ms 5196 KB n=500
36 Correct 17 ms 5156 KB n=500
37 Correct 19 ms 5060 KB n=500
38 Correct 16 ms 5176 KB n=500
39 Correct 12 ms 5176 KB n=500
40 Correct 12 ms 5068 KB n=500
41 Correct 9 ms 5068 KB n=500
42 Correct 10 ms 5068 KB n=500
43 Correct 11 ms 5068 KB n=500
44 Correct 9 ms 5068 KB n=500
45 Correct 3 ms 5068 KB n=500
46 Correct 3 ms 5068 KB n=500
47 Correct 3 ms 5168 KB n=500
48 Correct 3 ms 5068 KB n=500
49 Correct 3 ms 5068 KB n=500
50 Correct 9 ms 5156 KB n=500
51 Correct 5 ms 5160 KB n=500
52 Correct 4 ms 5068 KB n=500
53 Correct 7 ms 5068 KB n=500
54 Correct 3 ms 5068 KB n=500
55 Correct 3 ms 5068 KB n=278
56 Correct 3 ms 5068 KB n=500
57 Correct 3 ms 5068 KB n=500
58 Correct 15 ms 5068 KB n=500
59 Correct 4 ms 5452 KB n=2000
60 Correct 7 ms 5580 KB n=2000
61 Correct 22 ms 5580 KB n=2000
62 Correct 23 ms 5544 KB n=2000
63 Correct 6 ms 5452 KB n=2000
64 Correct 22 ms 5552 KB n=2000
65 Correct 4 ms 5420 KB n=2000
66 Correct 14 ms 5584 KB n=2000
67 Correct 6 ms 5452 KB n=2000
68 Correct 21 ms 5564 KB n=2000
69 Correct 244 ms 5516 KB n=2000
70 Correct 236 ms 5520 KB n=2000
71 Correct 228 ms 5504 KB n=2000
72 Correct 128 ms 5632 KB n=2000
73 Correct 122 ms 5644 KB n=2000
74 Correct 4 ms 5424 KB n=1844
75 Correct 121 ms 5528 KB n=2000
76 Correct 132 ms 5508 KB n=2000
77 Correct 131 ms 5504 KB n=2000
78 Correct 124 ms 5516 KB n=2000
79 Correct 4 ms 5452 KB n=2000
80 Correct 11 ms 5548 KB n=2000
81 Correct 18 ms 5556 KB n=2000
82 Correct 4 ms 5452 KB n=2000
83 Correct 14 ms 5548 KB n=2000
84 Correct 75 ms 5520 KB n=2000
85 Correct 44 ms 5620 KB n=2000
86 Correct 50 ms 5532 KB n=2000
87 Correct 71 ms 5520 KB n=2000
88 Correct 25 ms 5548 KB n=2000
89 Correct 18 ms 5608 KB n=2000
90 Correct 11 ms 5604 KB n=2000
91 Correct 173 ms 5528 KB n=2000
92 Correct 780 ms 51756 KB n=200000
93 Execution timed out 4045 ms 55380 KB Time limit exceeded
94 Halted 0 ms 0 KB -