Submission #137486

#	Time	Username	Problem	Language	Result	Execution time	Memory
137486		vince	Friend (IOI14_friend)	C++14	16 / 100	2 ms	504 KiB

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
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31