제출 #589265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
589265		FatihSolak	친구 (IOI14_friend)	C++17	46 / 100	30 ms	4436 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
#define N 1005
using namespace std;
vector<int> adj[N];
bool vis[N];
int col[N];
vector<int> points;
int C[N];
int dfs0(int v){
	vis[v] = 1;
	int ret = C[v];
	for(auto u:adj[v]){
		if(vis[u])continue;
		ret = max(ret,dfs0(u));
	}
	return ret;
}
pair<long long,long long> dfs1(int v){
	vis[v] = 1;
	pair<long long,long long> ret = {0,C[v]};
	for(auto u:adj[v]){
		if(vis[u])continue;
		auto tmp = dfs1(u);
		ret.first += tmp.second;
		ret.second += tmp.first;
	}
	ret.second = max(ret.second,ret.first);
	return ret;
}
void dfs2(int v){
	vis[v] = 1;
	points.push_back(v);
	for(auto u:adj[v]){
		if(vis[u])continue;
		col[u] = (col[v] == 1?2:1);
		dfs2(u);
	}
}
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	for(int i = 0;i<n;i++){
		C[i] = confidence[i];
	}
	int SUBTASK = 1;
	set<int> s;
	for(int i = 1;i<n;i++){
		s.insert(protocol[i]);
	}
	if(n > 10 && s.size() == 2){
		SUBTASK = 5;
	}
	if(n > 10 && s.size() == 1){
		if(*s.begin() == 0){
			SUBTASK = 4;
		}
		if(*s.begin() == 1){
			SUBTASK = 2;
		}
		if(*s.begin() == 2){
			SUBTASK = 3;
		}
	}
	for(int i = 1;i<n;i++){
		if(protocol[i] == 0){
			adj[i].push_back(host[i]);
			adj[host[i]].push_back(i);
		}
		if(protocol[i] == 1){
			for(auto u:adj[host[i]]){
				adj[i].push_back(u);
				adj[u].push_back(i);
			}
		}
		if(protocol[i] == 2){
			for(auto u:adj[host[i]]){
				adj[i].push_back(u);
				adj[u].push_back(i);
			}
			adj[i].push_back(host[i]);
			adj[host[i]].push_back(i);
		}
	}
	if(SUBTASK == 1){
		long long ans = 0;
		for(int mask = 1;mask < (1<<n);mask++){
			long long sum = 0;
			bool ok = 1;
			for(int i = 0;i<n;i++){
				if(mask & (1<<i)){
					sum += confidence[i];
					for(auto u:adj[i]){
						if(mask & ( 1<<u))
							ok = 0;
					}
				}
			}
			if(ok){
				ans = max(ans,sum);
			}
		}
		return ans;
	}
	if(SUBTASK == 2){
		long long sum = 0;
		for(int i = 0;i<n;i++){
			sum += confidence[i];
		}
		return sum;
	}
	if(SUBTASK == 3){
		long long sum = 0;
		for(int i = 0;i<n;i++){
			if(!vis[i]){
				sum += dfs0(i);
			}
		}
		return sum;
	}
	if(SUBTASK == 4){
		long long sum = 0;
		for(int i = 0;i<n;i++){
			if(!vis[i]){
				sum += dfs1(i).second;
			}
		}
		return sum;
	}
	if(SUBTASK == 5){
		long long sum = 0;
		for(int i = 0;i<n;i++){
			if(!vis[i]){
				points.clear();
				col[i] = 0;
				dfs2(i);
				int cnt1 = 0,cnt2 = 0;
				for(auto u:points){
					if(col[u] == 1)cnt1++;
					else cnt2++;
				}
				sum += max(cnt1,cnt2);
			}
		}
		return sum;
	}
	return 0;
}

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