Submission #73003

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
73003	2018-08-27T13:01:54 Z	nvmdava	Friend (IOI14_friend)	C++17	16 / 100	4 ms	620 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;
	s = confidence[0];
	for(int i = 1; i < n; i++){
		if(protocol[i] == 2){
			s = max(confidence[i], s);
		} else {
			s += confidence[i];
		}
	}
	return s;
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	376 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	2 ms	488 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	3 ms	488 KB	Output is correct
4	Correct	3 ms	488 KB	Output is correct
5	Correct	3 ms	596 KB	Output is correct
6	Correct	3 ms	596 KB	Output is correct
7	Correct	2 ms	596 KB	Output is correct
8	Correct	3 ms	596 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct

Subtask #3
8.0 / 8.0

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