#include<bits/stdc++.h>
using namespace std;
#include "walk.h"
long long min_distance(std::vector<long long> x, std::vector<long long> h, std::vector<long long> l, std::vector<long long> r, std::vector<long long> y, long long s, long long g) {
const long long n = (long long)x.size();
const long long m = (long long)l.size();
vector<set<long long>>v(n);
v[g].insert(0);
set<pair<long long,pair<long long,long long>>>connected;
for(long long i = 0 ; i < m ; i++) {
for(long long ii = l[i] ; ii <= r[i] ; ii++) {
if(ii < r[i])
connected.insert({y[i], {ii, ii+1}});
v[ii].insert(y[i]);
}
}
map<pair<long long,long long>,long long>dist;
priority_queue<pair<long long,pair<long long,long long>>>pq;
pq.push({0,{s,0}});
while(!pq.empty()) {
auto node = pq.top();
pq.pop();
auto [i,y] = node.second;
if(i > 0 && v[i-1].count(y) && connected.count({y, {i-1,i}})) {
if((!dist.count({i-1,y}) || dist[{i,y}] + i - x[i-1] < dist[{i-1,y}])) {
dist[{i-1,y}] = dist[{i,y}] + x[i] - x[i-1];
pq.push({-dist[{i-1,y}], {i-1, y}});
}
}
if(i < n-1 && v[i+1].count(y) && connected.count({y, {i,i+1}})) {
if((!dist.count({i+1,y}) || dist[{i,y}] + x[i+1] - i < dist[{i+1,y}])) {
dist[{i+1,y}] = dist[{i,y}] + x[i+1] - x[i];
pq.push({-dist[{i+1,y}], {i+1, y}});
}
}
for(auto it = v[i].begin() ; it != v[i].end() ; it++) {
long long yy = *it;
if(yy > h[i] || y > h[i])
break;
if(!dist[{i,yy}] || dist[{i,y}] + abs(y - yy) < dist[{i,yy}]) {
dist[{i,yy}] = dist[{i,y}] + abs(y - yy);
pq.push({-dist[{i,yy}], {i, yy}});
}
}
}
return dist[{g,0}];
}
Compilation message
/usr/bin/ld: /tmp/ccnmMTKW.o: in function `main':
grader.cpp:(.text.startup+0x395): undefined reference to `min_distance(std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, int, int)'
collect2: error: ld returned 1 exit status
