oj.uz

Submission #1072904

# Submission time Handle Problem Language Result Execution time Memory
1072904 2024-08-24T06:49:30 Z MuhammadSaram Beech Tree (IOI23_beechtree) C++17
5 / 100
 57 ms 6740 KB 
#include <bits/stdc++.h>

using namespace std;

const int M = 2000;

vector<int> nei[M];
int col[M],par[M],s[M],t;
bool pos[M];

void dfs(int u)
{
	s[u]=++t;
	for (int i:nei[u])
		dfs(i);
	vector<int> v;
	for (int i=0;i<M;i++)
		if (!s[i])
			break;
		else if(s[i]>=s[u])
			v.push_back(i);
	sort(v.begin(),v.end());
	do
	{
		if (v[0]!=u)
			continue;
		map<int,int> cnt;
		bool b=1;
		for (int j=1;j<v.size() && b;j++)
		{
			int i=v[j];
			if (v[cnt[col[i]]]!=par[i])
				b=0;
			else
				cnt[col[i]]++;
		}
		if (b)
		{
			pos[u]=1;
			break;
		}
	}while(next_permutation(v.begin(),v.end()));
}

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c)
{
	vector<int> ans(n);
	if (n<=8)
	{
		for (int i=0;i<n;i++)
			col[i]=c[i],par[i]=p[i];
		for (int i=1;i<n;i++)
			nei[p[i]].push_back(i);
		dfs(0);
		for (int i=0;i<n;i++)
			ans[i]=pos[i];
		return ans;
	}
	set<int> se;
	for (int i=n-1;i>=0;i--)
	{
		ans[i]=1;
		se.insert(c[i]);
		if (se.size()==2)
			break;
	}
	return ans;
}

Compilation message

beechtree.cpp: In function 'void dfs(int)':
beechtree.cpp:29:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   for (int j=1;j<v.size() && b;j++)
      |                ~^~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Runtime error 1 ms 604 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 44 ms 6736 KB Output is correct
8 Correct 52 ms 6740 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 484 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 38 ms 6488 KB Output is correct
18 Correct 38 ms 6648 KB Output is correct
19 Correct 38 ms 6740 KB Output is correct
20 Correct 57 ms 6740 KB Output is correct

Subtask #3
0.0 / 9.0

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

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 44 ms 6736 KB Output is correct
6 Correct 52 ms 6740 KB Output is correct
7 Incorrect 0 ms 348 KB 2nd lines differ - on the 3rd token, expected: '1', found: '0'
8 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Runtime error 1 ms 604 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Runtime error 1 ms 604 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -