제출 #1042965

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042965		ALeonidou	친구 (IOI14_friend)	C++17	8 / 100	1 ms	348 KiB

friend

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

#define ll int
#define  F first
#define S second
#define pb push_back
#define endl "\n"
#define sz(x) (ll)x.size()

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
	for (ll i =0; i<sz(v); i++){
		cout<<v[i]<<" ";
	}
	cout<<endl;
}

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){

	ll s = 0;
	//subtask 2:
	// for (ll i =0; i<n; i++){
	// 	s += confidence[i];
	// }

	//subtask 3:
	for (ll i =0; i<n; i++){
		s = max(s, confidence[i]);
	}

	return s;
}

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