Submission #72996

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
72996	2018-08-27T12:50:34 Z	nvmdava	Friend (IOI14_friend)	C++17	8 / 100	3 ms	932 KB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

int findSample(int n,int confidence[],int host[],int protocol[]){
	int s = 0;
	for(int i = 0; i < n; i++){
		s = max(confidence[i], s);
	}
	return s;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	488 KB	Output is correct
2	Correct	3 ms	556 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	3 ms	680 KB	Output is correct
5	Correct	3 ms	764 KB	Output is correct
6	Correct	3 ms	776 KB	Output is correct
7	Correct	3 ms	780 KB	Output is correct
8	Correct	2 ms	780 KB	Output is correct
9	Correct	3 ms	808 KB	Output is correct
10	Correct	3 ms	932 KB	Output is correct