Submission #586329

#	Time	Username	Problem	Language	Result	Execution time	Memory
586329		LastRonin	친구 (IOI14_friend)	C++14	16 / 100	1 ms	212 KiB

friend

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


int findSample(int n,int confidence[],int host[],int protocol[]){
    bool eq = 1;
    for(int j = 1; j < n - 1; j++) {
		if(protocol[j] != protocol[j + 1])
			eq = 0;						
    }
    if(eq) {
    	if(protocol[1] == 1) {
			// empty
			ll sum = 0;
			for(int j = 0; j < n; j++)
				sum += confidence[j];
			return sum;
    	} else if(protocol[1] == 2) {
			// full
			ll mx = 0;
			for(int j = 0; j < n; j++)
				mx = max(mx, (ll)confidence[j]);
			return mx;
    	} else if(protocol[1] == 0) {
    		// tree
    		return -1;
    	}
    }
	return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31