oj.uz

Submission #874063

# Submission time Handle Problem Language Result Execution time Memory
874063 2023-11-16T08:40:40 Z yhkhoo Friend (IOI14_friend) C++17
0 / 100
 1 ms 348 KB 
#include "friend.h"

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	int ans=0;
	bool st1=true,st2=true,st3=true,st4=true;
	if(n>10)
		st1=false;
	for(int i=0; i<n; i++){
		if(protocol[i] == 0){
			st2=false;
			st3=false;
		}
		else if(protocol[i] == 1){
			st3=false;
			st4=false;
		}
		else{
			st2=false;
			st4=false;
		}
	}
	if(st2){
		for(int i=0; i<n; i++){
			ans += confidence[i];
		}
	}
	else if(st3){
		for(int i=0; i<n; i++){
			if(confidence[i] > ans){
				ans = confidence[i];
			}
		}
	}
	else if(st1){
	}
	else if(st4){
	}
	return ans;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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