oj.uz

답안 #628792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
628792 2022-08-13T17:10:39 Z BackNoob Birthday gift (IZhO18_treearray) C++14
0 / 100
 31 ms 59092 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
int n;
int m;
int q;
int a[mxN];
int depth[mxN];
int par[mxN][LOG + 2];
vector<int> adj[mxN];
multiset<int> pos[mxN];
multiset<int> lca[mxN];
 
void dfs(int u, int p)
{
	for(int v : adj[u]) {
		if(v == p) continue;
		par[v][0] = u;
		depth[v] = depth[u] + 1;
		dfs(v, u);
	}
}

int getlca(int u, int v)
{
	if(depth[u] < depth[v]) swap(u, v);

	for(int j = LOG; j >= 0; j--) 
		if(depth[par[u][j]] >= depth[v]) u = par[u][j];

	if(u == v) return u;

	for(int j = LOG; j >= 0; j--) {
		if(par[u][j] != par[v][j]) {
			u = par[u][j];
			v = par[v][j];
		}
	}
	return par[u][0];
}
void solve()
{
	cin >> n >> m >> q;
	for(int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	par[1][0] = 1;
	dfs(1, -1);


	for(int j = 1; j <= LOG; j++)
	for(int i = 1; i <= n; i++) par[i][j] = par[par[i][j - 1]][j - 1];


	for(int i = 1; i <= m; i++) {
		cin >> a[i];
		pos[a[i]].insert(i);
	}

	for(int i = 1; i < m; i++) {
		lca[getlca(a[i], a[i + 1])].insert(i);
	}


	while(q--) {
		int op;
		cin >> op;
		if(op == 1) {
			int p, val;
			cin >> p >> val;

			pos[a[p]].erase(pos[a[p]].find(p));
			if(p > 1) {
				int _lca = getlca(a[p], a[p - 1]);
				lca[_lca].erase(lca[_lca].find(p - 1));
			}
			if(p < m) {
				int _lca = getlca(a[p], a[p + 1]);
				lca[_lca].erase(lca[_lca].find(p));
			}
			a[p] = val;
			pos[a[p]].insert(p);

			if(p < m) {
				int _lca = getlca(a[p], a[p + 1]);
				lca[_lca].insert(p);
			}
			if(p > 1) {
				int _lca = getlca(a[p], a[p - 1]);
				lca[_lca].insert(p - 1);
			}
		}
		else {
			int l, r, x;
			cin >> l >> r >> x;

			auto it = pos[x].lower_bound(l);
			if(it != pos[x].end()) {
				int tmp = *it;
				if(tmp <= r) {
					cout << tmp << ' ' << tmp << endl;
					continue;
				}
			}

			it = lca[x].lower_bound(l);
			if(it != lca[x].end()) {
				int tmp = *it;
				if(tmp <= r) {
					cout << tmp << ' ' << tmp + 1 << endl;
					continue;
				}
			}
			cout << -1 << ' ' << -1 << endl;

		}
	}


}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 58956 KB n=5
2 Correct 28 ms 59048 KB n=100
3 Correct 28 ms 58956 KB n=100
4 Correct 29 ms 59052 KB n=100
5 Correct 31 ms 58964 KB n=100
6 Correct 28 ms 59020 KB n=100
7 Correct 28 ms 59084 KB n=100
8 Correct 28 ms 59068 KB n=100
9 Correct 29 ms 59056 KB n=100
10 Correct 29 ms 59032 KB n=100
11 Correct 29 ms 59092 KB n=100
12 Incorrect 28 ms 59076 KB Wrong output format.
13 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 58956 KB n=5
2 Correct 28 ms 59048 KB n=100
3 Correct 28 ms 58956 KB n=100
4 Correct 29 ms 59052 KB n=100
5 Correct 31 ms 58964 KB n=100
6 Correct 28 ms 59020 KB n=100
7 Correct 28 ms 59084 KB n=100
8 Correct 28 ms 59068 KB n=100
9 Correct 29 ms 59056 KB n=100
10 Correct 29 ms 59032 KB n=100
11 Correct 29 ms 59092 KB n=100
12 Incorrect 28 ms 59076 KB Wrong output format.
13 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 58956 KB n=5
2 Correct 28 ms 59048 KB n=100
3 Correct 28 ms 58956 KB n=100
4 Correct 29 ms 59052 KB n=100
5 Correct 31 ms 58964 KB n=100
6 Correct 28 ms 59020 KB n=100
7 Correct 28 ms 59084 KB n=100
8 Correct 28 ms 59068 KB n=100
9 Correct 29 ms 59056 KB n=100
10 Correct 29 ms 59032 KB n=100
11 Correct 29 ms 59092 KB n=100
12 Incorrect 28 ms 59076 KB Wrong output format.
13 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 58956 KB n=5
2 Correct 28 ms 59048 KB n=100
3 Correct 28 ms 58956 KB n=100
4 Correct 29 ms 59052 KB n=100
5 Correct 31 ms 58964 KB n=100
6 Correct 28 ms 59020 KB n=100
7 Correct 28 ms 59084 KB n=100
8 Correct 28 ms 59068 KB n=100
9 Correct 29 ms 59056 KB n=100
10 Correct 29 ms 59032 KB n=100
11 Correct 29 ms 59092 KB n=100
12 Incorrect 28 ms 59076 KB Wrong output format.
13 Halted 0 ms 0 KB -