제출 #404146

#제출 시각아이디문제언어결과실행 시간메모리
404146Kenzo_1114친구 (IOI14_friend)C++17
8 / 100
1 ms420 KiB
#include<bits/stdc++.h>
#include"friend.h"
using namespace std;
const int MAXN = 100010;

int n, c[MAXN], h[MAXN], p[MAXN];

/*
	0 : for IAmYourFriend
	1 : for MyFriendsAreYourFriends
	2 : forWeAreYourFriends
*/

int findSample(int N, int Confidence[], int Host[], int Protocol[])
{
	n = N;
	for(int i = 0; i < N; i++)	c[i] = Confidence[i];
	for(int i = 0; i < N; i++)	h[i] = Host[i];
	for(int i = 0; i < N; i++)	p[i] = Protocol[i];

	int sum = 0;
	for(int i = 0; i < N; i++) sum += c[i];

	return sum;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...