Submission #398091

#	Time	Username	Problem	Language	Result	Execution time	Memory
398091		prvocislo	Friend (IOI14_friend)	C++17	0 / 100	1 ms	332 KiB

friend

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <bitset>
typedef long long ll;
using namespace std;

const int maxn = 1005;
bitset<maxn> g[maxn];
int findSample(int n, int c[], int h[], int pr[])
{
	for (int i = 1; i < n; i++)
	{
		if (pr[i])
		{
			g[i] = g[h[i]];
		}
		if (pr[i] != 1)
			g[i][h[i]] = 1;
		for (int j = 0; j < i; j++) if (g[i][j]) g[j][i] = 1;
	}
	bitset<maxn> ans;
	for (int i = n - 1; i >= 0; i--)
	{
		if (!(g[i] & ans).count())
			ans[i] = 1;
	}
	return ans.count();
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31