제출 #197880

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
197880		Masterdan	친구 (IOI14_friend)	C++14	8 / 100	3 ms	380 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
// Find out best sample
#define all(a)  a.begin (),a.end ()
#define MIN -1
#define MAX 1e9+7
#define F first
#define S second
#define mk make_pair()
#define pb push_back
using namespace std;
typedef vector <int> vi;
typedef pair<int, int> ii;
int findSample(int n,int confidence[],int host[],int protocol[]){
       int s=0;
        for(int i=0;i<n;i++)s+=confidence[i];
        return s;
}/*
#include <cstdio>
#include <cassert>
#define __MAXSIZE__ 100002

using namespace std;

// Confidence
int confidence[__MAXSIZE__];

// Host
int host[__MAXSIZE__];

// Protocol
int protocol[__MAXSIZE__];

// Main
int main(void)
{
	int n,i;

	// Number of people
	assert(scanf("%d",&n)==1);

	// Confidence
	for(i=0;i<n;i++)
		assert(scanf("%d",&confidence[i])==1);

	// Host and Protocol
	for(i=1;i<n;i++)
		assert(scanf("%d %d",&host[i],&protocol[i])==2);

	// Answer
	printf("%d\n",findSample(n,confidence,host,protocol));
	return 0;
}
*/

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