Submission #403485

#	Time	Username	Problem	Language	Result	Execution time	Memory
403485		errorgorn	족보 (KOI18_family)	C++17	44 / 100	3091 ms	15804 KiB

family

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n[2],k;
int root[2];
vector<int> al[2][100005];

vector< bitset<5005> > ranges[2];

bitset<5005> dfs(int i,int j){
	bitset<5005> res;
	if (i<=k) res[i]=1;
	
	for (auto &it:al[j][i]){
		res|=dfs(it,j);
	}
	
	//cout<<j<<endl;
	//rep(x,1,4) cout<<res[x]<<" "; cout<<endl;
	ranges[j].pub(res);
	return res;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n[0]>>n[1]>>k;
	
	rep(y,0,2){
		int t;
		rep(x,1,n[y]+1){
			cin>>t;
			
			if (t==0) root[y]=x;
			else al[y][t].pub(x);
		}
		
		dfs(root[y],y);
	}
	
	bool can=true;
	
	for (auto &it:ranges[0]){
		for (auto &it2:ranges[1]){
			bitset<5005> temp=it&it2;
			if (temp.count() && temp!=it && temp!=it2) can=false;
		}
	}
	
	if (can) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}

• Subtask 1: 17 / 17
• Subtask 2: 27 / 27
• Subtask 3: 0 / 15
• Subtask 4: 0 / 41