Submission #105234

#	Time	Username	Problem	Language	Result	Execution time	Memory
105234		TuGSGeReL	Friend (IOI14_friend)	C++14	11 / 100	59 ms	4088 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back()
#define ss second
#define ff first
#define mt make_tuple
#define pof pop_front()
#define fbo find_by_order
#define ook order_of_key

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
using pll = pair <ll, ll>;
using pii = pair <int, int>;

int used[11];
vector <int> edg[11];

int findSample(int n,int confidence[],int host[],int protocol[]){
	
	int ans = 0;
	
	for (int i = 1; i < n; i++)
	{
		if ( !protocol[i] )
		{
			edg[i].pub(host[i]);
			edg[host[i]].pub(i);
		} else if ( protocol[i] == 1 )
		{
			for (int j = 0; j < edg[host[i]].size(); j++)
			{
				edg[edg[host[i]][j]].pub(i);
				edg[i].pub(edg[host[i]][j]);
			}
		} else {
			for (int j = 0; j < edg[host[i]].size(); j++)
			{
				edg[i].pub(edg[host[i]][j]);
				edg[edg[host[i]][j]].pub(i);
			}

			edg[i].pub(host[i]);
			edg[host[i]].pub(i);
		}
	}
	
	for (int i = 0; i < (1 << n); i++)
	{
		memset(used, 0, sizeof used);
		bool boo = 0;
		int res = 0;

		for (int j = 0; j < n; j++)
		{
			if ( i & (1 << j) )
			{
				for ( auto x : edg[j] )
					if ( used[x] )
						boo = 1;

				res += confidence[j];
				used[j] = 1;
			}
		}

		if ( !boo )
			ans = max(ans, res);
	}
	
	return ans;
}

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:38:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < edg[host[i]].size(); j++)
                    ~~^~~~~~~~~~~~~~~~~~~~~
friend.cpp:44:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < edg[host[i]].size(); j++)
                    ~~^~~~~~~~~~~~~~~~~~~~~

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