oj.uz

답안 #1071382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071382 2024-08-23T07:03:49 Z UmairAhmadMirza 참나무 (IOI23_beechtree) C++17
0 / 100
 4 ms 15120 KB 
#include <bits/stdc++.h>
using namespace std;

int const N=2e5+5;
vector<int> child[N];
set<int> ch_col[N];
vector<int> ans;
int dep[N];
void dfs(int node){
	ans[node]=1;
	vector<int> ch;
	for(int i:child[node]){
		dfs(i);
		dep[node]=max(dep[i]+1,dep[node]);
		if(dep[i]==1)
			ch.push_back(i);
	}
	if(ch.size()>1 || dep[node]>=2 || child[node].size()!=ch_col[node].size()){
		ans[node]=0;
		return;
	}
	if(ch.size()==0)
		return;
	// if(ans[ch[0]]==0)
	// 	ans[node]=0;
	for(int c:ch_col[ch[0]])
		if(ch_col[node].find(c)==ch_col[node].end())
			ans[node]=0;
	return;
}
vector<int> beechtree(int n, int M, vector<int> P, vector<int> C){
	for (int i = 1; i < n; ++i){
		child[P[i]].push_back(i);
		ch_col[P[i]].insert(C[i]);
	}
	ans.resize(n);
	for (int i = 0; i < n; ++i)
		ans[i]=1;
	dfs(0);
	return ans;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Incorrect 2 ms 14940 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 14936 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 14936 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 4 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 2 ms 14940 KB Output is correct
6 Correct 2 ms 15120 KB Output is correct
7 Correct 2 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Incorrect 2 ms 14940 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
10 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 14936 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Incorrect 2 ms 14940 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 14936 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Incorrect 2 ms 14940 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 14936 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Incorrect 2 ms 14940 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -