Submission #129509

#	Time	Username	Problem	Language	Result	Execution time	Memory
129509		antimirage	Friend (IOI14_friend)	C++14	0 / 100	3 ms	632 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 15;

vector <int> g[N], vec;

int u[N], dp[1 << 15], ans, sum;


int findSample(int n, int val[], int batya[], int type[]) {
	
	assert(val[0] == 1);
	for (int i = 1; i < n; i++) {
		
		if (type[i] == 0) {
			g[batya[i]].pb(i);
			g[i].pb(batya[i]);
		}
		else if (type[i] == 1) {
			for (auto it: g[batya[i]]) {
				g[i].pb(it);
				g[it].pb(i);
			}
		}
		else {
			g[batya[i]].pb(i);
			g[i].pb(batya[i]);
		
			for (auto it: g[batya[i]]) {
				g[i].pb(it);
				g[it].pb(i);
			}
		}
	}
	for (int mask = 0; mask < (1 << n); mask++) {
		memset(u, 0, sizeof(u));
		sum = 0;
		for (int j = 0; j < n; j++) {
			if (mask>>j&1)
				u[j] = 1, sum += val[j];
		}
		bool fl = 1;
		for (int j = 0; j < n; j++) {
			if (u[j] == 0) continue;
			for (auto to : g[j]) {
				if (u[to])
					fl = 0;
			}
		}
		if (fl)
			ans = max(ans, sum);
	}
	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