oj.uz

답안 #402854

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
402854 2021-05-12T12:45:07 Z oolimry 족보 (KOI18_family) C++17
0 / 100
 11 ms 14400 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int,int> ii;

int n1, n2, K; 
vector<int> child[2][300005];
int num[2][300005];
int rep[2][300005];
struct check{ int num, u, t; };
vector<check> stuff;

void dfs(int t, int u){
	if(num[t][u] != 0) return;
	if(u != 0 && u <= K){
		num[t][u] = 1;
		rep[t][u] = u;
	}
	else{
		for(int v : child[t][u]){
			dfs(t, v);
			num[t][u] += num[t][v];
			rep[t][u] = rep[t][v];
		}
		if(num[t][u] > 1 and u != 0) stuff.push_back({num[t][u], u, t});
		///idk why child[t][u].size() > 1 is needed .-.
	}
}

int p[300005];
int sz[300005];
int findSet(int u){
	if(p[u] == u) return u;
	else return p[u] = findSet(p[u]);
}
void unionSet(int u, int v){
	u = findSet(u), v = findSet(v);
	if(u == v) return;
	if(u&1) swap(u,v);
	p[u] = v;
	sz[v] += sz[u];
}
int getSz(int u){
	return sz[findSet(u)];
}

int main(){
	freopen("i.txt","r",stdin);
	cin >> n1 >> n2 >> K;
	
	for(int i = 1;i <= n1;i++){
		int a; cin >> a;
		child[0][a].push_back(i);
	}
	for(int i = 1;i <= n2;i++){
		int a; cin >> a;
		child[1][a].push_back(i);
	}
	
	//for(int i = 1;i <= n1;i++) dfs(0, i);
	//for(int i = 1;i <= n2;i++) dfs(1, i);
	
	dfs(0, 0); dfs(1, 0);
	
	for(int i = 1;i <= K;i++){
		p[i] = i;
		sz[i] = 1;
	}
		
	sort(all(stuff), [&](check a, check b){ return a.num < b.num; });
	
	for(check C : stuff){
		for(int v : child[C.t][C.u]){
			unionSet(rep[C.t][C.u], rep[C.t][v]);
		} 
		if(getSz(rep[C.t][C.u]) != C.num){
			cout << "NO";
			return 0;
		}
	}
	
	
	cout << "YES";
}

Compilation message

family.cpp: In function 'int main()':
family.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  freopen("i.txt","r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14400 KB Output is correct
2 Correct 10 ms 14400 KB Output is correct
3 Incorrect 11 ms 14400 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14400 KB Output is correct
2 Correct 10 ms 14400 KB Output is correct
3 Incorrect 11 ms 14400 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14400 KB Output is correct
2 Correct 10 ms 14400 KB Output is correct
3 Incorrect 11 ms 14400 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14400 KB Output is correct
2 Correct 10 ms 14400 KB Output is correct
3 Incorrect 11 ms 14400 KB Output isn't correct
4 Halted 0 ms 0 KB -