oj.uz

Submission #1071282

# Submission time Handle Problem Language Result Execution time Memory
1071282 2024-08-23T06:32:55 Z Faisal_Saqib Beech Tree (IOI23_beechtree) C++17
0 / 100
 2000 ms 1372 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()==1 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Execution timed out 2092 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1368 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1368 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2033 ms 1368 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1368 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Execution timed out 2092 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1368 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Execution timed out 2092 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1368 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Execution timed out 2092 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -