Submission #808868

#	Time	Username	Problem	Language	Result	Execution time	Memory
808868		OrazB	Friend (IOI14_friend)	C++14	11 / 100	1099 ms	65536 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

const int N = 1e5+5;
int c[N];
ll mx = 0;
vector<int> E[N];

void bit(int x, int n, int A[]){
	if (x == n){
		ll sum = 0;
		for (int i = 0; i < n; i++){
			if (c[i]){
				for (auto j : E[i]) if (c[j]) return;
				sum += A[i];
			}
		}
		mx = max(mx, sum);
		return;
	}
	for (int i = 0; i < 2; i++){
		c[x] = i;
		bit(x+1, n, A);
	}
}

int findSample(int n, int A[], int u[], int v[]){
	for (int i = 1; i < n; i++){
		if (v[i] == 1 or v[i] == 2){
			for (auto j : E[u[i]]){
				E[i].pb(j);
				E[j].pb(i);
			}
		}
		if (v[i] == 0 or v[i] == 2){
			E[i].pb(u[i]);
			E[u[i]].pb(i);
		}
	}
	bit(0, n, A);
	return mx;
}


// int main ()
// {
// 	ios::sync_with_stdio(false);
// 	cin.tie(0);
// 	int n;
// 	cin >> n;
// 	int A[n], a[n], b[n];
// 	for (int i = 0; i < n; i++) cin >> A[i];
// 	for (int i = 1; i < n; i++) cin >> a[i] >> b[i];
// 	cout << findSample(n, A, a, b);
// }	

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