Submission #403485

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
403485	2021-05-13T08:34:37 Z	errorgorn	None (KOI18_family)	C++17	44 / 100	3000 ms	15804 KB

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.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	5 ms	5112 KB	Output is correct
3	Correct	4 ms	5068 KB	Output is correct
4	Correct	4 ms	5068 KB	Output is correct
5	Correct	5 ms	5068 KB	Output is correct
6	Correct	4 ms	5060 KB	Output is correct
7	Correct	4 ms	5068 KB	Output is correct
8	Correct	4 ms	5068 KB	Output is correct
9	Correct	4 ms	5068 KB	Output is correct
10	Correct	4 ms	5068 KB	Output is correct
11	Correct	4 ms	5068 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	4 ms	5068 KB	Output is correct
14	Correct	30 ms	5520 KB	Output is correct
15	Correct	29 ms	5580 KB	Output is correct
16	Correct	30 ms	5520 KB	Output is correct
17	Correct	20 ms	5524 KB	Output is correct
18	Correct	14 ms	5424 KB	Output is correct
19	Correct	29 ms	5520 KB	Output is correct
20	Correct	30 ms	5640 KB	Output is correct
21	Correct	30 ms	5552 KB	Output is correct
22	Correct	20 ms	5528 KB	Output is correct
23	Correct	4 ms	4924 KB	Output is correct
24	Correct	15 ms	5520 KB	Output is correct
25	Correct	4 ms	5008 KB	Output is correct
26	Correct	4 ms	5068 KB	Output is correct
27	Correct	4 ms	5068 KB	Output is correct
28	Correct	4 ms	5068 KB	Output is correct
29	Correct	5 ms	5068 KB	Output is correct
30	Correct	4 ms	5068 KB	Output is correct

Subtask #2
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	5 ms	5112 KB	Output is correct
3	Correct	4 ms	5068 KB	Output is correct
4	Correct	4 ms	5068 KB	Output is correct
5	Correct	5 ms	5068 KB	Output is correct
6	Correct	4 ms	5060 KB	Output is correct
7	Correct	4 ms	5068 KB	Output is correct
8	Correct	4 ms	5068 KB	Output is correct
9	Correct	4 ms	5068 KB	Output is correct
10	Correct	4 ms	5068 KB	Output is correct
11	Correct	4 ms	5068 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	4 ms	5068 KB	Output is correct
14	Correct	30 ms	5520 KB	Output is correct
15	Correct	29 ms	5580 KB	Output is correct
16	Correct	30 ms	5520 KB	Output is correct
17	Correct	20 ms	5524 KB	Output is correct
18	Correct	14 ms	5424 KB	Output is correct
19	Correct	29 ms	5520 KB	Output is correct
20	Correct	30 ms	5640 KB	Output is correct
21	Correct	30 ms	5552 KB	Output is correct
22	Correct	20 ms	5528 KB	Output is correct
23	Correct	4 ms	4924 KB	Output is correct
24	Correct	15 ms	5520 KB	Output is correct
25	Correct	4 ms	5008 KB	Output is correct
26	Correct	4 ms	5068 KB	Output is correct
27	Correct	4 ms	5068 KB	Output is correct
28	Correct	4 ms	5068 KB	Output is correct
29	Correct	5 ms	5068 KB	Output is correct
30	Correct	4 ms	5068 KB	Output is correct
31	Correct	4 ms	5068 KB	Output is correct
32	Correct	4 ms	5068 KB	Output is correct
33	Correct	4 ms	5068 KB	Output is correct
34	Correct	4 ms	5068 KB	Output is correct
35	Correct	4 ms	4940 KB	Output is correct
36	Correct	22 ms	5524 KB	Output is correct
37	Correct	13 ms	5580 KB	Output is correct
38	Correct	29 ms	5652 KB	Output is correct
39	Correct	35 ms	5648 KB	Output is correct
40	Correct	29 ms	5648 KB	Output is correct
41	Correct	4 ms	5068 KB	Output is correct
42	Correct	4 ms	5068 KB	Output is correct
43	Correct	4 ms	5068 KB	Output is correct
44	Correct	5 ms	5068 KB	Output is correct
45	Correct	4 ms	5092 KB	Output is correct
46	Correct	30 ms	5644 KB	Output is correct
47	Correct	21 ms	5524 KB	Output is correct
48	Correct	35 ms	5648 KB	Output is correct
49	Correct	36 ms	5716 KB	Output is correct
50	Correct	25 ms	5652 KB	Output is correct

Subtask #3
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	5 ms	5112 KB	Output is correct
3	Correct	4 ms	5068 KB	Output is correct
4	Correct	4 ms	5068 KB	Output is correct
5	Correct	5 ms	5068 KB	Output is correct
6	Correct	4 ms	5060 KB	Output is correct
7	Correct	4 ms	5068 KB	Output is correct
8	Correct	4 ms	5068 KB	Output is correct
9	Correct	4 ms	5068 KB	Output is correct
10	Correct	4 ms	5068 KB	Output is correct
11	Correct	4 ms	5068 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	4 ms	5068 KB	Output is correct
14	Correct	30 ms	5520 KB	Output is correct
15	Correct	29 ms	5580 KB	Output is correct
16	Correct	30 ms	5520 KB	Output is correct
17	Correct	20 ms	5524 KB	Output is correct
18	Correct	14 ms	5424 KB	Output is correct
19	Correct	29 ms	5520 KB	Output is correct
20	Correct	30 ms	5640 KB	Output is correct
21	Correct	30 ms	5552 KB	Output is correct
22	Correct	20 ms	5528 KB	Output is correct
23	Correct	4 ms	4924 KB	Output is correct
24	Correct	15 ms	5520 KB	Output is correct
25	Correct	4 ms	5008 KB	Output is correct
26	Correct	4 ms	5068 KB	Output is correct
27	Correct	4 ms	5068 KB	Output is correct
28	Correct	4 ms	5068 KB	Output is correct
29	Correct	5 ms	5068 KB	Output is correct
30	Correct	4 ms	5068 KB	Output is correct
31	Correct	4 ms	5068 KB	Output is correct
32	Correct	4 ms	5068 KB	Output is correct
33	Correct	4 ms	5068 KB	Output is correct
34	Correct	4 ms	5068 KB	Output is correct
35	Correct	4 ms	4940 KB	Output is correct
36	Correct	22 ms	5524 KB	Output is correct
37	Correct	13 ms	5580 KB	Output is correct
38	Correct	29 ms	5652 KB	Output is correct
39	Correct	35 ms	5648 KB	Output is correct
40	Correct	29 ms	5648 KB	Output is correct
41	Correct	4 ms	5068 KB	Output is correct
42	Correct	4 ms	5068 KB	Output is correct
43	Correct	4 ms	5068 KB	Output is correct
44	Correct	5 ms	5068 KB	Output is correct
45	Correct	4 ms	5092 KB	Output is correct
46	Correct	30 ms	5644 KB	Output is correct
47	Correct	21 ms	5524 KB	Output is correct
48	Correct	35 ms	5648 KB	Output is correct
49	Correct	36 ms	5716 KB	Output is correct
50	Correct	25 ms	5652 KB	Output is correct
51	Execution timed out	3091 ms	15804 KB	Time limit exceeded
52	Halted	0 ms	0 KB	-

Subtask #4
0 / 41.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	5 ms	5112 KB	Output is correct
3	Correct	4 ms	5068 KB	Output is correct
4	Correct	4 ms	5068 KB	Output is correct
5	Correct	5 ms	5068 KB	Output is correct
6	Correct	4 ms	5060 KB	Output is correct
7	Correct	4 ms	5068 KB	Output is correct
8	Correct	4 ms	5068 KB	Output is correct
9	Correct	4 ms	5068 KB	Output is correct
10	Correct	4 ms	5068 KB	Output is correct
11	Correct	4 ms	5068 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	4 ms	5068 KB	Output is correct
14	Correct	30 ms	5520 KB	Output is correct
15	Correct	29 ms	5580 KB	Output is correct
16	Correct	30 ms	5520 KB	Output is correct
17	Correct	20 ms	5524 KB	Output is correct
18	Correct	14 ms	5424 KB	Output is correct
19	Correct	29 ms	5520 KB	Output is correct
20	Correct	30 ms	5640 KB	Output is correct
21	Correct	30 ms	5552 KB	Output is correct
22	Correct	20 ms	5528 KB	Output is correct
23	Correct	4 ms	4924 KB	Output is correct
24	Correct	15 ms	5520 KB	Output is correct
25	Correct	4 ms	5008 KB	Output is correct
26	Correct	4 ms	5068 KB	Output is correct
27	Correct	4 ms	5068 KB	Output is correct
28	Correct	4 ms	5068 KB	Output is correct
29	Correct	5 ms	5068 KB	Output is correct
30	Correct	4 ms	5068 KB	Output is correct
31	Correct	4 ms	5068 KB	Output is correct
32	Correct	4 ms	5068 KB	Output is correct
33	Correct	4 ms	5068 KB	Output is correct
34	Correct	4 ms	5068 KB	Output is correct
35	Correct	4 ms	4940 KB	Output is correct
36	Correct	22 ms	5524 KB	Output is correct
37	Correct	13 ms	5580 KB	Output is correct
38	Correct	29 ms	5652 KB	Output is correct
39	Correct	35 ms	5648 KB	Output is correct
40	Correct	29 ms	5648 KB	Output is correct
41	Correct	4 ms	5068 KB	Output is correct
42	Correct	4 ms	5068 KB	Output is correct
43	Correct	4 ms	5068 KB	Output is correct
44	Correct	5 ms	5068 KB	Output is correct
45	Correct	4 ms	5092 KB	Output is correct
46	Correct	30 ms	5644 KB	Output is correct
47	Correct	21 ms	5524 KB	Output is correct
48	Correct	35 ms	5648 KB	Output is correct
49	Correct	36 ms	5716 KB	Output is correct
50	Correct	25 ms	5652 KB	Output is correct
51	Execution timed out	3091 ms	15804 KB	Time limit exceeded
52	Halted	0 ms	0 KB	-

Submission #403485

Compilation message

Subtask #1 17.0 / 17.0

Subtask #2 27.0 / 27.0

Subtask #3 0 / 15.0

Subtask #4 0 / 41.0

Subtask #1
17.0 / 17.0

Subtask #2
27.0 / 27.0

Subtask #3
0 / 15.0

Subtask #4
0 / 41.0