제출 #115301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115301		faustaadp	Friend (IOI14_friend)	C++17	16 / 100	5 ms	2816 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
// Find out best sample
ll i,n,b[3],a[101010],jum,ma,x[2];
vector<ll> v[101010];
void dfs(ll aa,ll bb,ll cc)
{
	x[cc]+=a[aa];
	ll ii;
	for(ii=0;ii<v[aa].size();ii++)
		if(v[aa][ii]!=bb)
			dfs(v[aa][ii],aa,1-cc);
}
int findSample(int n,int confidence[],int host[],int protocol[])
{
	//int ans=10;
	for(i=0;i<n;i++)
	{
		if(i>=1)
		{
			b[protocol[i]]=1;
			v[host[i]].pb(i);
			v[i].pb(host[i]);
		}
		a[i]=confidence[i];
		jum+=a[i];
		ma=max(ma,a[i]);
	}
	if(b[0]==0&&b[1]==1&&b[2]==0)
		return jum;
	if(b[0]==0&&b[1]==0&&b[2]==1)
		return ma;
	if(b[0]==1&&b[1]==0&&b[2]==0)
	{
		dfs(0,0,0);
		return max(x[0],x[1]);
	}
}

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'void dfs(ll, ll, ll)':
friend.cpp:16:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(ii=0;ii<v[aa].size();ii++)
           ~~^~~~~~~~~~~~~
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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