oj.uz

답안 #1071290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071290 2024-08-23T06:35:24 Z Faisal_Saqib 참나무 (IOI23_beechtree) C++17
9 / 100
 2000 ms 10788 KB 
#include <bits/stdc++.h>
using namespace std;
const int N1=20010;
int n,m,p[N1],c[N1],cnt[N1];
vector<int> sub[N1],ma[N1];
void dfs(int x)
{
	sub[x].clear();
	for(int&y:ma[x])
	{
		dfs(y);
		for(int&l:sub[y])sub[x].push_back(l);
		sub[x].push_back(y);
	}
}
std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
	n=N,m=M;
	bool subtask=1;
	for(int i=0;i<n;i++)p[i]=P[i],c[i]=C[i],ma[i].clear(),subtask=(subtask&((p[i]==(i-1))));
	if(subtask)
	{
		vector<int> b(n);
		map<int,int> cntp;
		for(int i=n-1;i>=0;i--)
		{
			cntp[c[i]]++;
			if(cntp.size()==1)
			{
				b[i]=1;
			}
			else if(cntp.size()==2 and min(cntp[c[i]],n-cntp[c[i]])==1)
			{
				b[i]=1;
			}
			else{
				b[i]=0;
			}
		}
		return b;
	}
	else
	{
		for(int i=1;i<n;i++)ma[p[i]].push_back(i);
		dfs(0);
		vector<int> b;
		for(int i=0;i<n;i++)
		{
			sort(begin(sub[i]),end(sub[i]));
			int sz=sub[i].size();
			bool good=1;
			do
			{
				good=1;
				for(int j=0;j<=500;j++)
					cnt[j]=0;
				for(int j=0;j<sz;j++)
				{
					int v=sub[i][j];
					int rp=-1;
					if(cnt[c[v]]>0)rp=sub[i][cnt[c[v]]-1];
					else{rp=i;}
					if(p[v]!=rp)
					{
						good=0;
						break;
					}
					cnt[c[v]]++;
				}
				if(good)break;
			}while(next_permutation(begin(sub[i]),end(sub[i])));
			b.push_back(good);
		}
		return b;
	}
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Execution timed out 2097 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1368 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 1 ms 1368 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1380 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 1 ms 1380 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 1 ms 1372 KB Output is correct
23 Correct 1 ms 1368 KB Output is correct
24 Correct 1 ms 1372 KB Output is correct
25 Correct 1 ms 1372 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 1 ms 1372 KB Output is correct
28 Correct 1 ms 1372 KB Output is correct
29 Correct 1 ms 1372 KB Output is correct
30 Correct 1 ms 1628 KB Output is correct
31 Correct 1 ms 1372 KB Output is correct
32 Correct 1 ms 1388 KB Output is correct
33 Correct 1 ms 1372 KB Output is correct
34 Correct 1 ms 1628 KB Output is correct

Subtask #2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1368 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Runtime error 41 ms 10788 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2066 ms 1372 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Runtime error 41 ms 10788 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Execution timed out 2097 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1380 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1380 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1368 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 1 ms 1372 KB Output is correct
23 Correct 1 ms 1372 KB Output is correct
24 Correct 1 ms 1372 KB Output is correct
25 Correct 1 ms 1372 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 1 ms 1372 KB Output is correct
28 Correct 2 ms 1372 KB Output is correct
29 Correct 1 ms 1372 KB Output is correct
30 Execution timed out 2023 ms 2392 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Execution timed out 2097 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1380 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1380 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1368 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 1 ms 1372 KB Output is correct
23 Correct 1 ms 1372 KB Output is correct
24 Correct 1 ms 1372 KB Output is correct
25 Correct 1 ms 1372 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 1 ms 1372 KB Output is correct
28 Correct 2 ms 1372 KB Output is correct
29 Correct 1 ms 1372 KB Output is correct
30 Execution timed out 2023 ms 2392 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Execution timed out 2097 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -