제출 #587115

#제출 시각아이디문제언어결과실행 시간메모리
587115hibikiFriend (IOI14_friend)C++11
16 / 100
1 ms348 KiB
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

#define pb push_back

// Find out best sample
int ans = 0;
vector<int> v[1005];
int dp[1005][2];

void dfs(int nw, int fa)
{
	dp[nw][0] = dp[nw][1] = 0;
	for(auto go: v[nw])
	{

	}
}

int findSample(int n,int c[],int h[],int p[]){
	int ty;
	for(int i = 1; i < n; i++)
		ty = p[i];
	// if(n < 20) ty = 3;
	if(ty == 0)
	{
		for(int i = 1; i < n; i++)
			v[h[i]].pb(i), v[i].pb(h[i]);
	}
	else if(ty == 1)
	{
		for(int i = 0; i < n; i++)
			ans += c[i];
	}
	else if(ty == 2)
	{
		for(int i = 0; i < n; i++)
			ans = max(ans, c[i]);
	}
	else
	{

	}
	return ans;
}

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

friend.cpp: In function 'void dfs(int, int)':
friend.cpp:15:11: warning: unused variable 'go' [-Wunused-variable]
   15 |  for(auto go: v[nw])
      |           ^~
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:31:7: warning: 'ty' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  else if(ty == 1)
      |       ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...