oj.uz

Submission #903139

# Submission time Handle Problem Language Result Execution time Memory
903139 2024-01-11T05:52:36 Z Muhammad_Aneeq Friend (IOI14_friend) C++17
27 / 100
 1000 ms 10628 KB 
#include <vector>
#include <iostream>
#include <set>
using namespace std;
int const N=2000;
bool ed[N][N]={};
int vis[N]={};
int ans=0;
int nn;
int val[N]={};
void dfs(int i,int val1)
{
	for (int j=0;j<nn;j++)
	{
		if (i==j)
			continue;
		if (vis[j]&&ed[i][j]==0)
			return;
	}
	for (int j=0;j<nn;j++)
	{
		if (i==j)
			continue;
		if (ed[i][j]&&!vis[j])
		{
			vis[j]=1;
			dfs(j,val1+val[j]);
			vis[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;
		set<int>s;
	for (int i=1;i<n;i++)
	{
		s.insert(protocol[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;
			}
		}
	}
	if (s.size()==1&&*begin(s)==1)
	{
		int ans=0;
		for (int i=0;i<n;i++)
			ans+=val[i];
		return ans;
	}
	for (int i=0;i<n;i++)
	{
		vis[i]=1;
		dfs(i,val[i]);
		vis[i]=0;
	}
	return ans;
}

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:38:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   38 |  for (int i=0;i<n;i++)
      |  ^~~
friend.cpp:41:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   41 |   set<int>s;
      |   ^~~

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 2392 KB Output is correct
3 Correct 0 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 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 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 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 6 ms 2396 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4720 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 3 ms 4696 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 2 ms 4856 KB Output is correct
5 Correct 3 ms 4696 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 5 ms 4700 KB Output is correct

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 2396 KB Output is correct
5 Correct 0 ms 2480 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 Execution timed out 1092 ms 4696 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 0 ms 2392 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 2392 KB Output is correct
8 Correct 1 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 2396 KB Output is correct
12 Runtime error 30 ms 10628 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -