| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 589238 | FatihSolak | Friend (IOI14_friend) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "friend.h"
#include <bits/stdc++.h>
#define N 1005
using namespace std;
vector<int> adj[N];
bool vis[N];
int C[N];
int dfs(int v){
vis[v] = 1;
int ret = C[v];
for(auto u:adj[v]){
if(vis[u])continue;
ret = max(ret,dfs(u));
}
return ret;
}
// 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;
}
}
if(SUBTASK == 1){
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);
}
}
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){
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);
}
}
long long sum = 0;
for(int i = 0;i<n;i++){
if(!vis[i]){
sum += dfs0(i);
}
}
return sum;
}
return 0;
}