제출 #1341669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1341669		selunelle	경주 (Race) (IOI11_race)	C++20	컴파일 에러	0 ms	0 KiB

race

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define pb push_back
vector<bool>vt;
void dfs(ll u,vector<vector<ll>>&e,map<pair<ll,ll>,ll>&mp,vector<pair<ll,ll>>&v,vector<map<ll,ll>>&v5,ll&k,ll&ans){
	if(vt[u]) return;
	vt[u]=true;
	v5[u][v[u].ff]=v[u].ss; 
	for(auto v1:e[u]){
		if(vt[v1]) continue;
		v[v1].ff=v[u].ff+mp[{u,v1}];
		v[v1].ss=v[u].ss+1;
		v5[v1][v[v1].ff]=v[v1].ss;
		dfs(v1,e,mp,v,v5,k,ans);
		for(auto jj:v5[v1]){
			ll d=jj.ff,c=jj.ss;
			if(d>k) continue;
			if(v5[u].count(k-d)) ans=min(ans,v5[u][k-d]+c);
		}
		if(v5[u].size()<v5[v1].size()) swap(v5[u],v5[v1]);
		for(auto jj:v5[v1]){
			ll d=jj.ff,c=jj.ss;
			if(v5[u].count(d)) v5[u][d]=min(v5[u][d],c);
			else v5[u][d]=c;
		}
	}
}

int main(){
	ll n,k,i,a,b,c;
	cin>>n>>k;
	vector<vector<ll>>e(n+1);
	map<pair<ll,ll>,ll>mp;
	for(i=1;i<n;i++){
		cin>>a>>b>>c;
		e[a].pb(b);
		e[b].pb(a);
		mp[{a,b}]=c;
		mp[{b,a}]=c;
	}
	vt.resize(n+1,false);
	vector<map<ll,ll>>v5(n+1);
	vector<pair<ll,ll>>v(n+1);
	v[1]={0,0}; 
	ll ans=LLONG_MAX;
	dfs(1,e,mp,v,v5,k,ans);
	if(ans==LLONG_MAX) cout<<-1;
	else cout<<ans;
}

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

/usr/bin/ld: /tmp/ccdPOLFI.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cc6Tmwbm.o:race.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccdPOLFI.o: in function `main':
grader.cpp:(.text.startup+0x28): undefined reference to `best_path(int, int, int (*) [2], int*)'
collect2: error: ld returned 1 exit status