oj.uz

Submission #131735

# Submission time Handle Problem Language Result Execution time Memory
131735 2019-07-17T13:44:00 Z tinjyu Friend (IOI14_friend) C++14
11 / 100
 1000 ms 4344 KB 
#include "friend.h"
#include <iostream>
// Find out best sample
using namespace std;
int ans,n,map[1005][1005],cost[15],t[15],p=0;
int find(int x,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, int)':
friend.cpp:19:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
11.0 / 11.0

# 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 380 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 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 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 Execution timed out 1075 ms 4344 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 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 1067 ms 4344 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 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 Runtime error 39 ms 3708 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -