oj.uz

Submission #127944

# Submission time Handle Problem Language Result Execution time Memory
127944 2019-07-10T08:54:20 Z Boxworld Friend (IOI14_friend) C++14
0 / 100
 2 ms 424 KB 
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
int a[20][20],ok[20],C[20],ans=0,s=0;
void dfs(int p,int n){
	if (p==n)return;
	if (ok[p]==0){
		s+=C[p];
		ans=max(ans,s);
		for (int i=p+1;i<n;i++)
		if (a[p][i]==1)ok[i]=1;
		dfs(p+1,n);
		for (int i=p+1;i<n;i++)
		if (a[p][i]==1)ok[i]=0;
		s-=C[p];
	}
	dfs(p+1,n);
}
int findSample(int n,int confidence[],int host[],int protocol[]){
	if (n<=10){//task1
		memset(a,0,sizeof(a));
		memset(ok,0,sizeof(ok));
		for (int i=0;i<n;i++)C[i]=confidence[i];
		for (int i=1;i<n;i++){
			int P=protocol[i];
			if (P==0||P==2)a[host[i]][i]=a[i][host[i]]=1;
			if (P==1||P==2)
			for (int j=0;j<n;j++)
			if (a[host[i]][j]==1)a[j][i]=a[i][j]=1;
		}
		dfs(0,n);
	}else{
		if (protocol[1]=0){//task4
		
		}else if(protocol[1]=1){//task2
		
		}else{//task3
		
		}
	}
	return ans;
}

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:33:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   if (protocol[1]=0){//task4
       ~~~~~~~~~~~^~
friend.cpp:35:23: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   }else if(protocol[1]=1){//task2
            ~~~~~~~~~~~^~

Subtask #1
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 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 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 Incorrect 2 ms 424 KB Output isn't correct
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 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Incorrect 2 ms 376 KB Output isn't correct
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 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -