Submission #1324781

#	Time	Username	Problem	Language	Result	Execution time	Memory
1324781		Faggi	Friend (IOI14_friend)	C++20	0 / 100	1 ms	568 KiB

friend

#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i,n) for(i=0; i<n; i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;

const int MAXN=1001;

set<ll>grafo[MAXN];

int findSample(int n,int confidence[],int host[],int protocol[]){
	
    ll i, cant=n;
	for(i=1; i<n; i++)
    {
        if(protocol[i]==0)
        {
            grafo[i].insert(host[i]);
            grafo[host[i]].insert(i);
        }
        else
        {
            for(auto k:grafo[host[i]])
            {
                grafo[i].insert(k);
                grafo[k].insert(i);
            }
        }
    }

    while(true)
    {
        ll ma=0, nod;
        for(i=0; i<n; i++)
        {
            if(ma<sz(grafo[i]))
            {
                ma=sz(grafo[i]);
                nod=i;
            }
        }
        if(ma==0)
            break;
        cant--;
        for(auto k:grafo[nod])
        {
            auto it=grafo[k].find(nod);
            grafo[k].erase(it);
        }
        grafo[nod].clear();
    }
    return cant;
}

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