제출 #428210

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
428210		errorgorn	친구 (IOI14_friend)	C++17	0 / 100	2 ms	1100 KiB

friend

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n;
int arr[100005];

int memo[200005];
int p[200005];
int extra[200005];

int id[100005];
int IDX=1;

int dp(int i){
	if (memo[i]!=-1) return memo[i];
	
	return memo[i]=dp(p[i])+extra[i];
}

int findSample(int N,int confidence[],int host[],int protocol[]){
	n=N;
	
	id[0]=0;
	
	rep(x,1,n){
		if (protocol[x]==0){
			p[IDX]=0;
			extra[IDX]=arr[x]+arr[host[x]];
			id[x]=IDX++;
			
			p[IDX]=id[host[x]];
			extra[IDX]=arr[x];
			id[host[x]]=IDX++;
		}
		else if (protocol[x]==1){
			
		}
		else{
			
		}
	}
	
	memset(memo,-1,sizeof(memo));
	memo[0]=0;
	
	int ans=0;
	rep(x,0,n) ans=max(ans,dp(x));
	
	return ans; 
}

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