제출 #589939

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

friend

#include <bits/stdc++.h>
//#define LOL
#if !defined(LOL)
    #include "friend.h"
#endif
using namespace std;
 
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int maxn = (int)2e5+10;
vector<int> adj[maxn]; 
set<int> S;
void add_edge(int a, int b){
    adj[a].pb(b); adj[b].pb(a);
}

void add_friends(int a, int b){
    for(auto u : adj[a]) add_edge(u,b);
}

bool chk(int s){
    for(auto u : adj[s])
        if(S.count(u)) return false;
    return true;
}

int findSample(int n, int c[], int h[], int pro[])
{
    for(int i = 1; i < n; i++){
        if(pro[i]!=1) add_edge(h[i],i);
        if(pro[i]) add_friends(h[i],i);
    }
    vector<int> v(n,0); iota(all(v),0); 
    int ans = 0;
    do{
        int sum = 0; S.clear();
        for(auto u : v) if(chk(u)) sum+=c[u], S.insert(u);
        ans = max(ans, sum);
    }while(next_permutation(all(v)));
    return ans;
}
//0->1, 2, 3, 4, 5
#if defined(LOL)

int main(void)
{
    #define __MAXSIZE__ 100002
    int confidence[__MAXSIZE__];
    int host[__MAXSIZE__];
    int protocol[__MAXSIZE__];
    int n,i;

    // Number of people
    assert(scanf("%d",&n)==1);
    
    // Confidence
    for(i=0;i<n;i++)
        assert(scanf("%d",&confidence[i])==1);
    
    // Host and Protocol
    for(i=1;i<n;i++)
        assert(scanf("%d %d",&host[i],&protocol[i])==2);
    
    // Answer
    printf("%d\n",findSample(n,confidence,host,protocol));
    return 0;
}
#endif

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