# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
131736 |
2019-07-17T13:46:52 Z |
tinjyu |
Friend (IOI14_friend) |
C++14 |
|
1000 ms |
8184 KB |
#include "friend.h"
#include <iostream>
// Find out best sample
using namespace std;
long long int ans,n,map[1005][1005],cost[1005],t[15],p=0;
int find(int x,long long int tmp)
{
ans=max(ans,tmp);
if(x==n)return 0;
find(x+1,tmp);
for(int i=1;i<=p;i++)
{
if(map[x][t[i]]==1)return 0;
}
p++;
t[p]=x;
find(x+1,tmp+cost[x]);
p--;
}
int findSample(int N,int confidence[],int host[],int protocol[]){
n=N;
for(int i=0;i<n;i++)cost[i]=confidence[i];
int cmp=0;
for(int i=1;i<n;i++)if(protocol[i]==1)cmp++;
for(int i=0;i<n;i++)ans+=cost[i];
if(cmp==n)return ans;
ans=0;
for(int i=1;i<n;i++)
{
int now=host[i];
if(protocol[i]==0 || protocol[i]==2)
{
map[now][i]=1;
map[i][now]=1;
}
if(protocol[i]==1 || protocol[i]==2)
{
for(int j=0;j<n;j++)
{
if(map[now][j]==1)
{
map[i][j]=1;
map[j][i]=1;
}
}
}
}
find(0,0);
return ans;
}
Compilation message
friend.cpp: In function 'int find(int, long long int)':
friend.cpp:19:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
376 KB |
Output is correct |
15 |
Correct |
2 ms |
376 KB |
Output is correct |
16 |
Correct |
2 ms |
380 KB |
Output is correct |
17 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1066 ms |
376 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
3576 KB |
Output is correct |
2 |
Correct |
18 ms |
7800 KB |
Output is correct |
3 |
Correct |
2 ms |
760 KB |
Output is correct |
4 |
Correct |
10 ms |
5624 KB |
Output is correct |
5 |
Correct |
17 ms |
7800 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
4 ms |
2040 KB |
Output is correct |
8 |
Correct |
5 ms |
2936 KB |
Output is correct |
9 |
Correct |
2 ms |
760 KB |
Output is correct |
10 |
Correct |
20 ms |
8184 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Execution timed out |
1078 ms |
4344 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Execution timed out |
1063 ms |
4476 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
380 KB |
Output is correct |
6 |
Correct |
2 ms |
380 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Runtime error |
40 ms |
4472 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
13 |
Halted |
0 ms |
0 KB |
- |