Submission #137486

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
137486	2019-07-28T04:42:59 Z	vince	Friend (IOI14_friend)	C++14	16 / 100	2 ms	504 KB

friend

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <limits.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#include <string>
#include <unordered_map>
#include <map>
#include <queue>
#include <set>
#include <stack>

using namespace std;

#define fi first
#define se second
typedef pair<int,int> ii;

int n;
int A[100003], T[100003], H[100003];
bool task2 = 1, task3 = 1;

int par[100003];
int parent(int u) { return par[u] = (par[u] == u)? u : parent(par[u]); }

int solve(int task)
{
	int sum = 0;
	int mx = 0;
	for(int i = 0; i < n; i++)
	{
		sum += A[i];
		mx = max(mx, A[i]);
	}

	if(task == 2) return sum;
	if(task == 3) return mx;
	return -1;
}



// Find out best sample
int findSample(int N,int confidence[],int host[],int protocol[])
{
	n = N;
	for(int i = 0; i < n; i++)
		A[i] = confidence[i];

	for(int i = 1; i < n; i++)
	{
		T[i] = protocol[i], H[i] = host[i];
		if(T[i] != 1) task2 = 0;
		if(T[i] != 2) task3 = 0;
		// printf("%d\n", T[i]);
	}
			
	if(task2) return solve(2);
	if(task3) return solve(3);

	return -1;
}

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	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	396 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	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	504 KB	Output is correct

Subtask #3
8.0 / 8.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	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct