Submission #902962

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
902962	2024-01-11T04:58:09 Z	Muhammad_Aneeq	Friend (IOI14_friend)	C++17	19 / 100	1000 ms	35928 KB

friend

#include <vector>
#include "friend.h"
#include <iostream>
using namespace std;
int const N=2000;
int ed[N][N]={};
int vis[N]={};
int ans=0;
int nn;
int val[N]={};
int cur[N]={};
void dfs(int i,int val1)
{
	vis[i]=1;
	for (int j=0;j<nn;j++)
		cur[j]=cur[j]+(ed[i][j]==0);
	for (int j=0;j<nn;j++)
	{
		if (ed[i][j]&&!vis[j]&&cur[j]==0)
			dfs(j,val1+val[j]);
	}
	vis[i]=0;
	for (int j=0;j<nn;j++)
		cur[j]=cur[j]-(ed[i][j]==0);
	ans=max(ans,val1);
}
int findSample(int n,int confidence[],int host[],int protocol[])
{
	nn=n;
	for (int i=0;i<n;i++)
		val[i]=confidence[i];
	for (int i=0;i<n;i++)
		for (int j=0;j<n;j++)
			ed[i][j]=1;
	for (int i=1;i<n;i++)
	{
		if (protocol[i]==0)
			ed[i][host[i]]=ed[host[i]][i]=0;
		else if (protocol[i]==1)
		{
			for (int j=0;j<n;j++)
			{
				if (ed[host[i]][j]==0)
					ed[i][j]=ed[j][i]=0;
			}
		}
		else
		{
			ed[i][host[i]]=ed[host[i]][i]=0;
			for (int j=0;j<n;j++)
			{
				if (ed[host[i]][j]==0)
					ed[i][j]=ed[j][i]=0;
			}
		}
	}
	for (int i=0;i<n;i++)
		dfs(i,val[i]);
	return ans;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2400 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	2 ms	2396 KB	Output is correct
8	Correct	2 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	3 ms	2396 KB	Output is correct

Subtask #2

0 / 8.0

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

Subtask #3

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	6492 KB	Output is correct
2	Correct	4 ms	10844 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	3 ms	8792 KB	Output is correct
5	Correct	4 ms	10844 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	2 ms	4440 KB	Output is correct
8	Correct	2 ms	6488 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	6 ms	10844 KB	Output is correct

Subtask #4

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2408 KB	Output is correct
3	Correct	1 ms	2408 KB	Output is correct
4	Correct	1 ms	2408 KB	Output is correct
5	Execution timed out	1057 ms	10856 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2476 KB	Output is correct
8	Correct	1 ms	2564 KB	Output is correct
9	Execution timed out	1049 ms	10844 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Runtime error	178 ms	35928 KB	Execution killed with signal 11
13	Halted	0 ms	0 KB	-