oj.uz

Submission #288294

# Submission time Handle Problem Language Result Execution time Memory
288294 2020-09-01T11:42:48 Z AKaan37 Friend (IOI14_friend) C++17
8 / 100
 1 ms 384 KB 
#include "friend.h"
 
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	//~ for(int i=1;i<n;i++){
		//~ if(protocol[i]==0){
			//~ v[host[i]].pb(i);
			//~ v[i].pb(host[i]);
			//~ continue;
		//~ }
		//~ if(protocol[i]==1){
			//~ for(int j=0;j<(int)v[node].size();j++){
				
			//~ }
		//~ }
	//~ }
	int ans=0;
	for(int i=0;i<n;i++){
		ans+=confidence[i];
	}
	return ans;
}

Subtask #1
0 / 11.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 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 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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