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 pb push_back
using namespace std;
int findSample(int n,int confidence[],int host[],int protocol[]){
int ans=0;
if(n <= 12){
int mask = 0;
vector<int> friends[13];
for(int i=1;i<n;i++){
if(protocol[i] == 0){
friends[i].pb(host[i]);
friends[host[i]].pb(i);
}else {
for(auto x : friends[host[i]]){
friends[i].pb(x);
friends[x].pb(i);
}
if(protocol[i] == 2){
friends[i].pb(host[i]);
friends[host[i]].pb(i);
}
}
}
mask = 1;
while(mask < (1<<n)){
int cost = 0;
vector<bool> used(n);
for(int i=0;i<n;i++){
if(!((1<<i)&mask))continue;
bool ok = true;
for(auto x : friends[i])if(used[x])ok=false;
if(ok)cost += confidence[i], used[i] = true;
}
ans = max(cost, ans);
mask++;
}
}else if(protocol[1] == 1){
}else {
for(int i=0;i<n;i++)ans = max(ans, confidence[i]);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |