Submission #378291

#	Time	Username	Problem	Language	Result	Execution time	Memory
378291		Dan4Life	Friend (IOI14_friend)	C++17	0 / 100	14 ms	384 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fir first
#define sec second
#define all(a) a.begin(), a.end()
#define r_all(a) a.rbegin(), a.rend()
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0);


int findSample(int n, int confidence[], int host[], int protocol[])
{
  vector<int> adj[1010]; set<int> S;
    for(int i = 1; i < n; i++)
    {
        int x = host[i];
        if(protocol[i]==0)
        {
            adj[x].pb(i),adj[i].pb(x);
        }
        else if(protocol[i]==1)
        {
            for(auto u : adj[i]){
                adj[u].pb(i),adj[i].pb(u);
            }
        }
        else
        {
            adj[x].pb(i),adj[i].pb(x);
            for(auto u : adj[i]){
                adj[u].pb(i),adj[i].pb(u);
            }
        }
    }
    int ans = 0ll;
    for(int i = 0; i < n; i++)
    {
        S.clear();
        for(int j = 0; j < n; j++) if(j!=i)S.insert(j);
        for(auto u : adj[i]) S.erase(u);
        for(auto u : S) ans = max(ans, confidence[i]+confidence[u]);
    }
    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