Submission #815306

#	Time	Username	Problem	Language	Result	Execution time	Memory
815306		Liudas	Friend (IOI14_friend)	C++17	8 / 100	3 ms	3284 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
#define __MAXSIZE__ 100002
using namespace std;
void getmax(int head, int N, vector<vector<int>> &arr, int &m, set<int> been, int score, int conf[]){
    if(head == N){
        m = max(m, score);
        return;
    }
    set<int> nbeen = been;
    for(int i : arr[head]){
        nbeen.insert(i);
    }
    getmax(head + 1, N, arr, m, been, score, conf);
    if(been.find(head) == been.end())
    getmax(head + 1, N, arr, m, nbeen, score + conf[head], conf);
}
void dfs(int head, int par, vector<vector<int>> &arr, vector<int> &val){
    int v = 0;
    for(int i : arr[head]){
        if(i != par){
            dfs(i, head, arr, val);
            v += val[i];
        }
    }
    val[head] = max(val[head], v);
}
int findSample(int n,int confidence[],int host[],int protocol[]){
    int N = n;
    vector<vector<int>> arr(N);
    for(int k = 0; k < N-1; k ++){
        int i = k + 1;
        int h = host[k];
        if(protocol[k] == 0){
            arr[i].push_back(h);
            arr[h].push_back(i);
        }
        if(protocol[k] == 1){
            for(int j : arr[h]){
                arr[i].push_back(j);
                arr[j].push_back(i);
            }
        }
        if(protocol[k] == 2){
            arr[i].push_back(h);
            arr[h].push_back(i);
            for(int j : arr[h]){
                arr[i].push_back(j);
                arr[j].push_back(i);
            }
        }
    }
    if(n <= 10){
        int m = 0;
        set<int> brr;
        getmax(0, N, arr, m, brr, 0, confidence);
        return m;
    }
    else{
        if(count(protocol, protocol + n, 1) == n-1){
            return accumulate(confidence, confidence + n, 0ll);
        }
        if(count(protocol, protocol + n, 2) == n-1){
            return *max_element(confidence, confidence + n);
        }
        vector<int> val(N);
        for(int i = 0; i < N; i ++){
            val[i] = confidence[i];
        }
        dfs(0, -1, arr, val);
        return val[0];
    }
}

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