#include "walk.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
vector <pair <int, int> > g[maxn];
vector <pair <int,int> > inter[maxn];
int ver;
long long dist[maxn];
bool vis[maxn];
priority_queue <pair <long long, int> > q;
long long dijkstra(int a, int b)
{
// vis[a] = 1;
for(int i=0;i<ver;i++)
dist[i] = 1e18;
dist[a] = 0;
q.push({(long long)0, a});
while(!q.empty())
{
int v = q.top().second;
if(vis[v]||dist[v]!=-q.top().first){q.pop();continue;}
q.pop();
//cout<<v<<"->"<<dist[v]<<endl;
vis[v] =1;
if(v==b)return dist[v];
for(auto u:g[v])
{
//cout<<u.first<<" "<<dist[v]+u.second<<endl;
if(vis[u.first])continue;
if(dist[u.first]>dist[v]+u.second)
{
dist[u.first]=dist[v]+u.second;
q.push({-dist[u.first],u.first});
}
}
}
}
long long min_distance(std::vector<int> x, std::vector<int> h, std::vector<int> l, std::vector<int> r, std::vector<int> y, int s, int _g) {
ver = x.size();
int i,j;
//for(i=0;i<x.size();i++)
// inter[i].push_back({0,i});
inter[s].push_back({0,s});
inter[_g].push_back({0,_g});
for(i=0;i<l.size();i++)
{int prev = -1,id;
for(j=l[i];j<=r[i];j++)
{
if(y[i]>h[j])continue;
inter[j].push_back({y[i],ver});
if(prev!=-1)
{
g[ver].push_back({prev,x[j]-x[id]});
g[prev].push_back({ver,x[j]-x[id]});
}
prev = ver;
id = j;
ver++;
}
}
for(i=0;i<x.size();i++)
{
sort(inter[i].begin(),inter[i].end());
for(j=0;j<inter[i].size()-1;j++)
{
//cout<<i<<" :: "<<inter[i][j].first<<" "<<inter[i][j+1].first<<endl;
g[inter[i][j].second].push_back({inter[i][j+1].second,inter[i][j+1].first-inter[i][j].first});
g[inter[i][j+1].second].push_back({inter[i][j].second,inter[i][j+1].first-inter[i][j].first});
}
}
//cout<<"OK"<<endl;
return dijkstra(s,_g);
}
Compilation message
walk.cpp: In function 'long long int min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:45:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | for(i=0;i<l.size();i++)
| ~^~~~~~~~~
walk.cpp:61:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
61 | for(i=0;i<x.size();i++)
| ~^~~~~~~~~
walk.cpp:64:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
64 | for(j=0;j<inter[i].size()-1;j++)
| ~^~~~~~~~~~~~~~~~~~
walk.cpp: In function 'long long int dijkstra(int, int)':
walk.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
37 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4940 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4940 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4940 KB |
Output is correct |
| 4 |
Runtime error |
9 ms |
9932 KB |
Execution killed with signal 11 |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4940 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4940 KB |
Output is correct |
| 3 |
Runtime error |
67 ms |
23148 KB |
Execution killed with signal 11 |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
42 ms |
21008 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
42 ms |
21008 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4940 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4940 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4940 KB |
Output is correct |
| 4 |
Runtime error |
9 ms |
9932 KB |
Execution killed with signal 11 |
| 5 |
Halted |
0 ms |
0 KB |
- |
