제출 #132962

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

race

#include "race.h"
#include <iostream>
using namespace std;
long long int point[200005],tagt[200005],t[200005],pt=0,p=0,a=9999999,tag[200005],ans[10000][105],road[200005],map[4000005][3],n,k;
int find(int x)
{
	tag[x]=1;
	int g=road[x];
	//cout<<x<<endl;
	int c=1;
	while(g!=-1)
	{
		int now=map[g][0];
		if(tag[now]!=1)
		{
			find(now);
			if(tagt[x]==0)
			{
				pt++;
				point[x]=pt;
				tagt[x]=1;
				c=0;
			}
			//cout<<x<<" "<<now<<" "<<pt<<" "<<point[now]<<endl;
			for(int i=k-map[g][2];i>=0;i--)
			{
				//cout<<ans[point[now]][i]<<" ";
				if(ans[point[now]][i]!=-1)
				{
					if(ans[pt][i+map[g][2]]!=-1)ans[pt][i+map[g][2]]=min(ans[pt][i]+1,ans[point[now]][i+map[g][2]]);
					else ans[pt][i+map[g][2]]=ans[point[now]][i]+1;
				}
				//cout<<ans[pt][i+map[g][2]]<<"  ";
			}
			p++;
			//cout<<endl;
		}
		g=map[g][1];
	}
	if(ans[point[x]][k]!=-1)a=min(a,ans[point[x]][k]);
	//cout<<c<<endl;
	if(c==0)pt--;
	//cout<<x<<" "<<point[x]<<endl;
	//for(int i=0;i<=k;i++)cout<<ans[point[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<10000;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);
	if(a==9999999)a=-1;
  	return a;
}

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

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

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