제출 #874118

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

friend

#include <bits/stdc++.h>
#include "friend.h"
//#define DEBUG 1106
//#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
 
using namespace std;

 
int take[1106], notake[1106];
int findSample(int n, int confidence[], int host[], int protocol[]) {
	if(protocol[1]==0) {
		take[0] = confidence[0];
		notake[0] = 0;
		for (int i = 1; i < n; i++) {
			if(i==1) take[i] = confidence[i];
			else take[i] = max(take[i-2],notake[i-1]) + confidence[i];
			notake[i] = max(take[i-1],notake[i-1]);
		}
		return max(take[n-1],notake[n-1]);
	}
	int ret = 0;
	forn(i,n) {
		if(protocol[1]==1) ret += confidence[i];
		else ret = max(ret,confidence[i]);
	}
	return ret;
}

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