# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
479373 |
2021-10-11T13:57:28 Z |
lacito |
Friend (IOI14_friend) |
C++14 |
|
3 ms |
332 KB |
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> g;
vector<int> par;
vector<bool> vis;
bool dfs(int v){
vis[v] = true;
for(int u : g[v])
if(par[u] == -1 || (!vis[par[u]] && dfs(par[u]))) {
par[v] = u;
par[u] = v;
return true;
}
return false;
}
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
vector<bool> color(n);
g.resize(n);
for (int i = 1; i < n; i++) {
if (protocol[i] == 0) {
color[i] = !color[host[i]];
g[i].push_back(host[i]);
g[host[i]].push_back(i);
} else {
color[i] = color[host[i]];
for (int u : g[host[i]]) {
g[i].push_back(u);
g[u].push_back(i);
}
}
}
par.assign(n, -1);
int ans = 0;
for (int i = 0; i < n; i++) {
if (color[i]) continue;
vis.assign(n, false);
if (dfs(i)) ans++;
}
return n - ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
3 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
2 ms |
312 KB |
Output is correct |
21 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |