Submission #969620

#	Time	Username	Problem	Language	Result	Execution time	Memory
969620		GrindMachine	친구 (IOI14_friend)	C++17	11 / 100	1049 ms	65536 KiB

friend

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 10 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "friend.h"

int findSample(int n, int a[], int host[], int protocol[]){
	vector<int> adj[n];
	bool edge[n][n];

	rep1(i,n-1){
		int p = host[i];
		if(protocol[i] == 0){
			adj[p].pb(i), adj[i].pb(p);
		}
		else if(protocol[i] == 1){
			trav(v,adj[p]){
				adj[v].pb(i), adj[i].pb(v);
			}
		}
		else{
			trav(v,adj[p]){
				adj[v].pb(i), adj[i].pb(v);
			}
			adj[p].pb(i), adj[i].pb(p);
		}
	}

	memset(edge,0,sizeof edge);
	rep(u,n){
		trav(v,adj[u]){
			edge[u][v] = 1;
		}
	}

	int ans = 0;

	rep(mask,1<<n){
		vector<int> nodes;
		int cost = 0;

		rep(i,n){
			if(mask&(1<<i)){
				nodes.pb(i);
				cost += a[i];
			}
		}

		bool ok = true;
		trav(u,nodes){
			trav(v,nodes){
				if(edge[u][v]){
					ok = false;
				}
			}
		}

		if(!ok) conts;

		amax(ans,cost);
	}

	return ans;
}

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