제출 #346477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
346477		alishahali1382	친구 (IOI14_friend)	C++14	100 / 100	35 ms	3180 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=100010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int dp[MAXN][2];

int findSample(int n,int confidence[],int host[],int protocol[]){
	for (int i=0; i<n; i++) dp[i][0]=confidence[i];
	for (int v=n-1; v; v--){
		int u=host[v], t=protocol[v];
		if (t==0){
			dp[u][0]=max({dp[u][0], dp[u][1]+dp[v][0], dp[u][0]+dp[v][1]});
			dp[u][1]+=dp[v][0];
		}
		if (t==1){
			dp[u][0]+=dp[v][0];
			dp[u][1]+=dp[v][1];
		}
		if (t==2){
			int d0=dp[u][0], d1=dp[u][1];
			dp[u][0]=max({d0, d1+dp[v][0], d0+dp[v][1]});
			dp[u][1]+=dp[v][1];
		}
	}
	return dp[0][0];
}
/*
7
1 1 1 1 1 1 1
0 0
1 0
2 0
1 0
1 0
0 0

4
1 1 1 1
0 0
1 0
0 0

*/

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