제출 #313505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
313505		talant117408	친구 (IOI14_friend)	C++17	46 / 100	249 ms	65540 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <ll, ll> pii;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) (int)(v).size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const int N = 1e5+7;
int adj[13][13];
int dp[1007][2];
vector <vector <int>> graph(N);

void dfs(int v, int p = -1){
    
    for(auto to : graph[v]){
        if(to != p){
            dfs(to, v);
            dp[v][1] += dp[to][0];
            dp[v][0] += max(dp[to][1], dp[to][0]);
        }
    }
}

int findSample(int n, int conf[], int host[], int prot[]){
	
    int cnt = 0, cnt1 = 0, cnt2 = 0;
    for(int i = 1; i < n; i++){
        if(!prot[i]){
            cnt++;
            graph[host[i]].pb(i);
            graph[i].pb(host[i]);
        }
        else if(prot[i]&1){
            cnt1++;
            for(auto to : graph[host[i]]){
                graph[to].pb(i);
                graph[i].pb(to);
            }
        }
        else{
            cnt2++;
            for(auto to : graph[host[i]]){
                graph[to].pb(i);
                graph[i].pb(to);
            }
            graph[host[i]].pb(i);
            graph[i].pb(host[i]);
        }
    }
    
    if(n < 11){
        for(int i = 0; i < n; i++){
            for(auto to : graph[i]){
                adj[i][to] = adj[to][i] = 1;
            }
        }
        
        int mx = 0;
        for(int mask = 0; mask < (1<<n); mask++){
            int sum = 0;
            for(int i = 0; i < n; i++){
                if(mask & (1 << i)){
                    sum += conf[i];
                    for(int j = 0; j < n; j++){
                        if((mask & (1 << j)) && adj[j][i]) sum = -2e9;
                    }
                }
            }
            mx = max(mx, sum);
        }
        return mx;
    }
    else if(cnt1 == n-1){
        int sum = 0;
        for(int i = 0; i < n; i++){
            sum += conf[i];
        }
        return sum;
    }
    else if(cnt2 == n-1){
        int mx = 0;
        for(int i = 0; i < n; i++){
            mx = max(mx, conf[i]);
        }
        return mx;
    }
    else if(cnt == n-1){
        for(int i = 0; i < n; i++){
            dp[i][1] = conf[i];
        }
        dfs(0);
        return max(dp[0][0], dp[0][1]);
    }
    
    return 1;
}

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