# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874048 | Sandarach151 | Friend (IOI14_friend) | C++17 | 335 ms | 65536 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<bits/stdc++.h>
using namespace std;
int findSample(int n, int confidence[], int host[], int protocol[]){
set<int> adg[n];
for(int i=1; i<n; i++){
if(protocol[i]==0){
adg[host[i]].insert(i);
adg[i].insert(host[i]);
}
else if(protocol[i]==1){
for(auto u : adg[host[i]]){
adg[i].insert(u);
adg[u].insert(i);
}
}
else{
for(auto u : adg[host[i]]){
adg[i].insert(u);
adg[u].insert(i);
}
adg[host[i]].insert(i);
adg[i].insert(host[i]);
}
}
if(n<=10){
int maxx = 0;
for(int mask=0; mask < (1<<n); mask++){
bool test = true;
int cur = 0;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(((mask & (1<<i))!=0) && ((mask & (1<<j))!=0) && adg[i].count(j)){
test = false;
break;
}
}
if(!test){
break;
}
}
if(test){
for(int i=0; i<n; i++){
if((mask & (1<<i))!=0){
cur+=confidence[i];
}
}
maxx = max(maxx, cur);
}
}
return maxx;
}
}
Compilation message (stderr)
# | 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... |