oj.uz

답안 #403452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403452 2021-05-13T07:51:39 Z jamezzz 족보 (KOI18_family) C++14
17 / 100
 19 ms 28492 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include <ext/rope>
using namespace __gnu_cxx;

typedef tree<long long, null_type, less<long long>,
rb_tree_tag, tree_order_statistics_node_update> pbds;
//less_equal for identical elements

#define DEBUG

#ifdef DEBUG
#define debug(...) printf(__VA_ARGS__);
#else
#define debug(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;

int n[2],k,p,rt[2];
bool use[300005];
vi AL[2][300005];
vi l[2][300005];

void dfs(int t,int u){
	if(u<=k)l[t][u].pb(u);
	for(int v:AL[t][u]){
		dfs(t,v);
		for(int x:l[t][v])l[t][u].pb(x);
	}
	sort(all(l[t][u]));
}

int main(){
	sf("%d%d%d",&n[0],&n[1],&k);
	for(int t=0;t<2;++t){
		for(int i=1;i<=n[t];++i){
			sf("%d",&p);
			AL[t][p].pb(i);
			if(p==0)rt[t]=i;
		}
	}
	for(int t=0;t<2;++t){
		dfs(t,rt[t]);
	}
	/*
	for(int t=0;t<2;++t){
		pf("%d:\n",t);
		for(int i=1;i<=n[t];++i){
			for(int x:l[t][i])pf("%d ",x);
			pf("\n");
		}
	}
	*/
	for(int i=1;i<=n[1];++i){
		bool found=false;
		for(int j=1;j<=n[0];++j){
			if(use[j])continue;
			if(sz(l[1][i])!=sz(l[0][j]))continue;
			bool pos=true;
			for(int x=0;x<sz(l[1][i]);++x){
				if(l[1][i][x]!=l[0][j][x])pos=false;
			}
			if(pos){
				use[j]=true;
				found=true;
				break;
			}
		}
		if(!found)pf("NO\n"),exit(0);
	}
	pf("YES\n");
	
}

Compilation message

family.cpp: In function 'int main()':
family.cpp:56:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |  sf("%d%d%d",&n[0],&n[1],&k);
      |    ^
family.cpp:59:6: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |    sf("%d",&p);
      |      ^

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28460 KB Output is correct
2 Correct 16 ms 28364 KB Output is correct
3 Correct 16 ms 28480 KB Output is correct
4 Correct 16 ms 28364 KB Output is correct
5 Correct 17 ms 28464 KB Output is correct
6 Correct 18 ms 28488 KB Output is correct
7 Correct 18 ms 28420 KB Output is correct
8 Correct 19 ms 28380 KB Output is correct
9 Correct 15 ms 28492 KB Output is correct
10 Correct 16 ms 28428 KB Output is correct
11 Correct 18 ms 28492 KB Output is correct
12 Correct 18 ms 28484 KB Output is correct
13 Correct 19 ms 28452 KB Output is correct
14 Correct 16 ms 28492 KB Output is correct
15 Correct 18 ms 28492 KB Output is correct
16 Correct 16 ms 28476 KB Output is correct
17 Correct 16 ms 28492 KB Output is correct
18 Correct 16 ms 28480 KB Output is correct
19 Correct 16 ms 28480 KB Output is correct
20 Correct 16 ms 28492 KB Output is correct
21 Correct 16 ms 28444 KB Output is correct
22 Correct 15 ms 28436 KB Output is correct
23 Correct 16 ms 28480 KB Output is correct
24 Correct 16 ms 28492 KB Output is correct
25 Correct 16 ms 28384 KB Output is correct
26 Correct 18 ms 28452 KB Output is correct
27 Correct 15 ms 28424 KB Output is correct
28 Correct 15 ms 28364 KB Output is correct
29 Correct 17 ms 28408 KB Output is correct
30 Correct 16 ms 28476 KB Output is correct

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28460 KB Output is correct
2 Correct 16 ms 28364 KB Output is correct
3 Correct 16 ms 28480 KB Output is correct
4 Correct 16 ms 28364 KB Output is correct
5 Correct 17 ms 28464 KB Output is correct
6 Correct 18 ms 28488 KB Output is correct
7 Correct 18 ms 28420 KB Output is correct
8 Correct 19 ms 28380 KB Output is correct
9 Correct 15 ms 28492 KB Output is correct
10 Correct 16 ms 28428 KB Output is correct
11 Correct 18 ms 28492 KB Output is correct
12 Correct 18 ms 28484 KB Output is correct
13 Correct 19 ms 28452 KB Output is correct
14 Correct 16 ms 28492 KB Output is correct
15 Correct 18 ms 28492 KB Output is correct
16 Correct 16 ms 28476 KB Output is correct
17 Correct 16 ms 28492 KB Output is correct
18 Correct 16 ms 28480 KB Output is correct
19 Correct 16 ms 28480 KB Output is correct
20 Correct 16 ms 28492 KB Output is correct
21 Correct 16 ms 28444 KB Output is correct
22 Correct 15 ms 28436 KB Output is correct
23 Correct 16 ms 28480 KB Output is correct
24 Correct 16 ms 28492 KB Output is correct
25 Correct 16 ms 28384 KB Output is correct
26 Correct 18 ms 28452 KB Output is correct
27 Correct 15 ms 28424 KB Output is correct
28 Correct 15 ms 28364 KB Output is correct
29 Correct 17 ms 28408 KB Output is correct
30 Correct 16 ms 28476 KB Output is correct
31 Incorrect 19 ms 28388 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28460 KB Output is correct
2 Correct 16 ms 28364 KB Output is correct
3 Correct 16 ms 28480 KB Output is correct
4 Correct 16 ms 28364 KB Output is correct
5 Correct 17 ms 28464 KB Output is correct
6 Correct 18 ms 28488 KB Output is correct
7 Correct 18 ms 28420 KB Output is correct
8 Correct 19 ms 28380 KB Output is correct
9 Correct 15 ms 28492 KB Output is correct
10 Correct 16 ms 28428 KB Output is correct
11 Correct 18 ms 28492 KB Output is correct
12 Correct 18 ms 28484 KB Output is correct
13 Correct 19 ms 28452 KB Output is correct
14 Correct 16 ms 28492 KB Output is correct
15 Correct 18 ms 28492 KB Output is correct
16 Correct 16 ms 28476 KB Output is correct
17 Correct 16 ms 28492 KB Output is correct
18 Correct 16 ms 28480 KB Output is correct
19 Correct 16 ms 28480 KB Output is correct
20 Correct 16 ms 28492 KB Output is correct
21 Correct 16 ms 28444 KB Output is correct
22 Correct 15 ms 28436 KB Output is correct
23 Correct 16 ms 28480 KB Output is correct
24 Correct 16 ms 28492 KB Output is correct
25 Correct 16 ms 28384 KB Output is correct
26 Correct 18 ms 28452 KB Output is correct
27 Correct 15 ms 28424 KB Output is correct
28 Correct 15 ms 28364 KB Output is correct
29 Correct 17 ms 28408 KB Output is correct
30 Correct 16 ms 28476 KB Output is correct
31 Incorrect 19 ms 28388 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28460 KB Output is correct
2 Correct 16 ms 28364 KB Output is correct
3 Correct 16 ms 28480 KB Output is correct
4 Correct 16 ms 28364 KB Output is correct
5 Correct 17 ms 28464 KB Output is correct
6 Correct 18 ms 28488 KB Output is correct
7 Correct 18 ms 28420 KB Output is correct
8 Correct 19 ms 28380 KB Output is correct
9 Correct 15 ms 28492 KB Output is correct
10 Correct 16 ms 28428 KB Output is correct
11 Correct 18 ms 28492 KB Output is correct
12 Correct 18 ms 28484 KB Output is correct
13 Correct 19 ms 28452 KB Output is correct
14 Correct 16 ms 28492 KB Output is correct
15 Correct 18 ms 28492 KB Output is correct
16 Correct 16 ms 28476 KB Output is correct
17 Correct 16 ms 28492 KB Output is correct
18 Correct 16 ms 28480 KB Output is correct
19 Correct 16 ms 28480 KB Output is correct
20 Correct 16 ms 28492 KB Output is correct
21 Correct 16 ms 28444 KB Output is correct
22 Correct 15 ms 28436 KB Output is correct
23 Correct 16 ms 28480 KB Output is correct
24 Correct 16 ms 28492 KB Output is correct
25 Correct 16 ms 28384 KB Output is correct
26 Correct 18 ms 28452 KB Output is correct
27 Correct 15 ms 28424 KB Output is correct
28 Correct 15 ms 28364 KB Output is correct
29 Correct 17 ms 28408 KB Output is correct
30 Correct 16 ms 28476 KB Output is correct
31 Incorrect 19 ms 28388 KB Output isn't correct
32 Halted 0 ms 0 KB -