Submission #1341699

#	Time	Username	Problem	Language	Result	Execution time	Memory
1341699		selunelle	Race (IOI11_race)	C++20	Compilation error	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){
				if(v5[u].count(d-k)){
					ans=min(ans,abs(c-v[u].ss)+abs(v5[u][d-k]-v[u].ss));
				} 
			}
		}
		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 best_path(int N, int K, int H[][2], int L[]) {
    vector<vector<ll>> e(N);
    map<pair<ll,ll>, ll> mp;
    for(int i = 0; i < N - 1; i++) {
        int a = H[i][0], b = H[i][1], c = L[i];
        e[a].pb(b);
        e[b].pb(a);
        mp[{a,b}] = c;
        mp[{b,a}] = c;
    }
    vt.assign(N, false);
    vector<map<ll,ll>> v5(N);
    vector<pair<ll,ll>> v(N, {0,0});
    ll ans = 1e18;
    dfs(0, e, mp, v, v5, K, ans);
    if(ans == 1e18) return -1;
    else return ans;
}

Compilation message (stderr)

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:49:26: error: cannot bind non-const lvalue reference of type 'long long int&' to a value of type 'int'
   49 |     dfs(0, e, mp, v, v5, K, ans);
      |                          ^
race.cpp:8:106: note:   initializing argument 6 of 'void dfs(long long int, std::vector<std::vector<long long int> >&, std::map<std::pair<long long int, long long int>, long long int>&, std::vector<std::pair<long long int, long long int> >&, std::vector<std::map<long long int, long long int> >&, long long int&, long long int&)'
    8 | 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){
      |                                                                                                          ^