제출 #132981

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
132981		tinjyu	경주 (Race) (IOI11_race)	C++14	9 / 100	93 ms	25208 KiB

race

#include "race.h"
#include <iostream>
using namespace std;
int tag[200005],road[200005],map[400005][3],n,k;
short ans[200005][105];
int find(int x)
{
	tag[x]=1;
	int g=road[x];
	//cout<<x<<endl;
	while(g!=-1)
	{
		int now=map[g][0];
		if(tag[now]!=1)
		{
			
			find(now);
			for(int i=0;i<=k-map[g][2];i++)
			{
				if(ans[now][i]!=-1)
				{
					if(ans[x][i+map[g][2]]!=-1)ans[x][i+map[g][2]]=min(short(ans[now][i]+1),ans[x][i+map[g][2]]);
					else ans[x][i+map[g][2]]=ans[now][i]+1;
				}
			}
		}
		g=map[g][1];
	}
	//cout<<x<<endl;
	//for(int i=0;i<=k;i++)cout<<ans[x][i]<<" ";
	//cout<<endl;
}
int best_path(int N, int K, int H[][2], int L[])
{
	n=N,k=K;
	for(int i=0;i<n;i++)
	{
		for(int j=1;j<=k;j++)ans[i][j]=-1;
	}
	for(int i=0;i<n;i++)road[i]=-1;
	for(int i=0;i<n-1;i++)
	{
		int x=H[i][0],y=H[i][1];
		map[i*2][0]=y;
		map[i*2][1]=road[x];
		map[i*2][2]=L[i];
		road[x]=i*2;
		map[i*2+1][0]=x;
		map[i*2+1][1]=road[y];
		map[i*2+1][2]=L[i];
		road[y]=i*2+1;
	}
	find(0);
	short a=255;
	for(int i=0;i<n;i++)
	{
		if(ans[i][k]!=-1)a=min(ans[i][k],a);
	}
	if(a==255)a=-1;
  	return a;
}

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

race.cpp: In function 'int find(int)':
race.cpp:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• Subtask 1: 9 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57