Submission #398098

#	Time	Username	Problem	Language	Result	Execution time	Memory
398098		prvocislo	Friend (IOI14_friend)	C++17	0 / 100	31 ms	8876 KiB

friend

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

const int maxn = 1005;
set<int> g[maxn];
multiset<pair<int, int> > m;
void rmv(int u)
{
	for (int v : g[u])
		m.erase({ g[v].size(), v });
	g[u].clear();
}
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].insert(h[i]);
		for (int j = 0; j < i; j++) if (g[i].count(j)) g[j].insert(i);
	}
	for (int i = 0; i < n; i++) m.insert({ g[i].size(), i });
	int ans = 0;
	while (!m.empty())
	{
		int u = m.begin()->second; m.erase(m.begin());
		//cout << u << "\n";
		ans++; rmv(u);
	}
	return ans;
}

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