oj.uz

답안 #521898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521898 2022-02-03T11:50:16 Z Kalashnikov Birthday gift (IZhO18_treearray) C++17
0 / 100
 4 ms 4940 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;
 
int a[N];
vector<int> g[N];
int tin[N] , tout[N] , timer;
int up[N][20];
 
void dfs(int v = 1, int p = 0) {
	up[v][0] = p;
	for(int i = 1; i < 20; i ++) {
		up[v][i] = up[up[v][i-1]][i-1];
	}
	tin[v] = ++timer;
	
	for(auto to: g[v]) {
		if(to != p) {
			dfs(to , v);
		}
	}
	tout[v] = ++timer;
}
 
bool upper(int a , int b) {
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}
 
int lca(int a , int b) {
	if(upper(a , b)) return a;
	if(upper(b , a)) return b;
	
	for(int i = 19; i >= 0; i --) {
		if(up[a][i] && !upper(up[a][i] , b)) {
			a = up[a][i];
		}
	}
	
	return up[a][0];
}
 
void solve(int tc) {
	int n , m , q;
	cin >> n >> m >> q;
	for(int i = 1; i < n; i ++) {
		int a , b;
		cin >> a >> b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	dfs();
	for(int i = 1; i <= m; i ++) {
		cin >> a[i];
	}
	
	while(q --) {
		int t;
		cin >> t;
		if(t == 2) {
			int l , r , v;
			cin >> l >> r >> v;
			int fnd = 0;
			for(int i = l; i < r; i ++) {
				if(a[i] == v) {
					cout << i << ' ' << i << '\n';
					fnd = 1;
					break;
				}
              	if(a[i+1] == v) {
					cout << i+1 << ' ' << i+1 << '\n';
					fnd = 1;
					break;
				}
				if(lca(a[i] , a[i+1]) == v) {
					cout << i << ' ' << i+1 << '\n';
					fnd = 1;
					break;
				}
			}
			if(!fnd) {
				cout << "-1 -1\n";
			}
		}
		else {
			int pos , val;
			cin >> pos >> val;
			a[pos] = val;
		}
	}
}
/*
*/
main() {
    ios;
    int tt = 1 , tc = 0;
    // cin >> tt;
    while(tt --) {
        solve(++tc);
    }
    return 0;
}

Compilation message

treearray.cpp:103:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  103 | main() {
      | ^~~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4940 KB n=5
2 Correct 2 ms 4940 KB n=100
3 Correct 3 ms 4940 KB n=100
4 Correct 3 ms 4940 KB n=100
5 Correct 3 ms 4940 KB n=100
6 Correct 3 ms 4940 KB n=100
7 Correct 3 ms 4940 KB n=100
8 Correct 3 ms 4940 KB n=100
9 Correct 2 ms 4940 KB n=100
10 Correct 3 ms 4940 KB n=100
11 Correct 2 ms 4940 KB n=100
12 Correct 2 ms 4940 KB n=100
13 Correct 3 ms 4940 KB n=100
14 Correct 3 ms 4940 KB n=100
15 Correct 3 ms 4940 KB n=100
16 Incorrect 4 ms 4940 KB Jury has the answer but participant has not
17 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4940 KB n=5
2 Correct 2 ms 4940 KB n=100
3 Correct 3 ms 4940 KB n=100
4 Correct 3 ms 4940 KB n=100
5 Correct 3 ms 4940 KB n=100
6 Correct 3 ms 4940 KB n=100
7 Correct 3 ms 4940 KB n=100
8 Correct 3 ms 4940 KB n=100
9 Correct 2 ms 4940 KB n=100
10 Correct 3 ms 4940 KB n=100
11 Correct 2 ms 4940 KB n=100
12 Correct 2 ms 4940 KB n=100
13 Correct 3 ms 4940 KB n=100
14 Correct 3 ms 4940 KB n=100
15 Correct 3 ms 4940 KB n=100
16 Incorrect 4 ms 4940 KB Jury has the answer but participant has not
17 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4940 KB n=5
2 Correct 2 ms 4940 KB n=100
3 Correct 3 ms 4940 KB n=100
4 Correct 3 ms 4940 KB n=100
5 Correct 3 ms 4940 KB n=100
6 Correct 3 ms 4940 KB n=100
7 Correct 3 ms 4940 KB n=100
8 Correct 3 ms 4940 KB n=100
9 Correct 2 ms 4940 KB n=100
10 Correct 3 ms 4940 KB n=100
11 Correct 2 ms 4940 KB n=100
12 Correct 2 ms 4940 KB n=100
13 Correct 3 ms 4940 KB n=100
14 Correct 3 ms 4940 KB n=100
15 Correct 3 ms 4940 KB n=100
16 Incorrect 4 ms 4940 KB Jury has the answer but participant has not
17 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4940 KB n=5
2 Correct 2 ms 4940 KB n=100
3 Correct 3 ms 4940 KB n=100
4 Correct 3 ms 4940 KB n=100
5 Correct 3 ms 4940 KB n=100
6 Correct 3 ms 4940 KB n=100
7 Correct 3 ms 4940 KB n=100
8 Correct 3 ms 4940 KB n=100
9 Correct 2 ms 4940 KB n=100
10 Correct 3 ms 4940 KB n=100
11 Correct 2 ms 4940 KB n=100
12 Correct 2 ms 4940 KB n=100
13 Correct 3 ms 4940 KB n=100
14 Correct 3 ms 4940 KB n=100
15 Correct 3 ms 4940 KB n=100
16 Incorrect 4 ms 4940 KB Jury has the answer but participant has not
17 Halted 0 ms 0 KB -