제출 #599187

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599187		Koosha_mv	친구 (IOI14_friend)	C++14	100 / 100	57 ms	8064 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=1e5+99;

int n,a[N],dp[N][2];
vector<pair<int,int>> g[N];

void dfs(int u){
	vector<int> res(2),pes(2);
	res[1]=a[u];
	reverse(all(g[u]));
	for(auto [v,w] : g[u]){
		//cout<<u<<" -> "<<v<<" "<<w<<endl;
		dfs(v);
		fill(all(pes),0);
		f(i,0,2){
			f(b,0,2){
				int task=w*b;
				if(i==1 && bit(task,0)==1) continue ;
				maxm(pes[i || bit(task,1)],res[i]+dp[v][b]);
			}
		}
		res=pes;
	}
	dp[u][0]=res[0];
	dp[u][1]=res[1];
	//cout<<u<<" -> "<<dp[u][0]<<" "<<dp[u][1]<<endl;
}
int findSample(int _n,int confidence[],int host[],int protocol[]){
	n=_n;
	f(i,0,n) a[i]=confidence[i];
	f(i,1,n){
		g[host[i]].pb({i,protocol[i]+1});
	}
	dfs(0);
	return max(dp[0][0],dp[0][1]);
}

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'void dfs(int)':
friend.cpp:33:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   33 |  for(auto [v,w] : g[u]){
      |           ^

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