# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
415906 |
2021-06-01T16:59:47 Z |
LouayFarah |
Friend (IOI14_friend) |
C++14 |
|
1000 ms |
42416 KB |
#include "bits/stdc++.h"
#include "friend.h"
using namespace std;
vector<set<int>> adj;
set<int> em;
set<int> denied;
vector<int> c;
int dfs(int u, int n)
{
int r = c[u];
int temp = c[u];
denied.insert(u);
for(auto v: adj[u])
denied.insert(v);
for(int i = 0; i<n; i++)
{
if(!denied.count(i))
{
int val = dfs(i, n);
r = max(r, temp + val);
}
}
return r;
}
int findSample(int n, int confidence[], int host[], int protocol[])
{
c.resize(n);
for(int i = 0; i<n; i++)
c[i] = confidence[i];
adj.assign(n, em);
for(int i = 1; i<n; i++)
{
if(protocol[i]==0)
{
int x = host[i];
adj[x].insert(i);
adj[i].insert(x);
}
else if(protocol[i]==1)
{
int x = host[i];
for(auto v: adj[x])
{
adj[v].insert(i);
adj[i].insert(v);
}
}
else
{
int x = host[i];
adj[x].insert(i);
adj[i].insert(x);
for(auto v: adj[x])
{
adj[v].insert(i);
adj[i].insert(v);
}
}
}
int res = 0;
for(int i = 0; i<n; i++)
{
denied.clear();
int maxi = dfs(i, n);
res = max(res, maxi);
}
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
304 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Incorrect |
1 ms |
304 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
104 ms |
312 KB |
Output is correct |
2 |
Correct |
693 ms |
356 KB |
Output is correct |
3 |
Execution timed out |
1091 ms |
332 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
64 ms |
8900 KB |
Output is correct |
2 |
Runtime error |
514 ms |
42416 KB |
Memory limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Execution timed out |
1098 ms |
460 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
300 KB |
Output is correct |
2 |
Correct |
1 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 |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
2 ms |
204 KB |
Output is correct |
9 |
Execution timed out |
1049 ms |
460 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 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 |
300 KB |
Output is correct |
7 |
Incorrect |
1 ms |
300 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |