제출 #60518

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60518		WA_TLE	친구 (IOI14_friend)	C++14	100 / 100	71 ms	10216 KiB

friend

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
//#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1e9+7;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
//llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
#include"friend.h"
int findSample(int n,int confidence[],int host[],int protocol[]){
	vector<int>kan;kan.reserve(n+n);
	vector<int>ket;ket.reserve(n+n);
	vector<int>dco(n);
	int i;
	dco[0]=0;
	kan.pub(-1);ket.pub(-1);
	for(i=1;i<n;i++){
		int ue=host[i];
		int hou=protocol[i];
		if(hou==0){dco[i]=kan.size();kan.pub(dco[ue]);ket.pub(1);}
		else if(hou==1){
			int mto=dco[ue];
			dco[ue]=kan.size();kan.pub(mto);ket.pub(2);
			dco[i]=kan.size();kan.pub(mto);ket.pub(2);
		}else if(hou==2){
			int mto=dco[ue];
			dco[ue]=kan.size();kan.pub(mto);ket.pub(3);
			dco[i]=kan.size();kan.pub(mto);ket.pub(3);
		}
	}
	int m=kan.size();
	vector<llint>use(m);
	vector<llint>nou(m);
	for(i=0;i<n;i++){use[dco[i]]+=confidence[i];}
	for(i=m-1;i>=0;i--){
		maxeq(use[i],nou[i]);
		int ter=kan[i];
		if(ket[i]==1){
			use[ter]+=nou[i];
			nou[ter]+=use[i];
		}else if(ket[i]==2){
			use[ter]+=use[i];
			nou[ter]+=nou[i];
		}else if(ket[i]==3){
			use[ter]=max(use[ter]+nou[i],nou[ter]+use[i]);
			nou[ter]+=nou[i];
		}
	}
	//for(i=0;i<m;i++){cout<<use[i]<<" "<<nou[i]<<" "<<kan[i]<<" "<<ket[i]<<endl;}
	return use[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