# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23702 | Hiasat | Friend (IOI14_friend) | C++14 | 0 ms | 3220 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>
using namespace std;
vector<int> adj[1001];
int c[1001];
int f[2];
void dfs(int u , int color){
if(c[u] != -1){
assert(c[u] == color);
return;
}
c[u] = color;
f[color]++;
for (int i = 0; i < adj[u].size(); ++i){
dfs(adj[u][i],!color);
}
}
int findSample(int n,int confidence[],int host[],int protocol[]){
memset(c,-1,sizeof c);
for(int i = 1 ; i <= n-1; i++){
if(protocol[i] == 1){
adj[host[i]].push_back(i);
adj[i].push_back(host[i]);
}
if(protocol[i] == 2){
for(int j = 0 ; j < adj[host[i]].size();j++){
int v = adj[host[i]][j];
adj[v].push_back(i);
adj[i].push_back(v);
}
}
}
int ans = 0;
for (int i = 0; i < n; ++i){
if(c[i] != -1)
continue;
memset(f,0,sizeof f);
dfs(i,0);
ans += max(f[0],f[1]);
}
return ans;
}
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... |