| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1071461 | pcc | Sky Walking (IOI19_walk) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "walk.h"
#include <bits/stdc++.h>
using namespace std;
#define _all(T) T.begin(),T.end()
#define ll long long
#define pii pair<int,int>
#define fs first
#define sc second
#define pll pair<ll,ll>
const int mxn = 2e5+10;
const ll inf = 1e18;
vector<pii> paths[mxn];
vector<int> all;
map<pii,int> mp;
ll dist[mxn];
int N;
namespace DIJKSTRA{
priority_queue<pll,vector<pll>,greater<pll>> pq;
bitset<mxn> vis;
void GO(){
vis.reset();
for(int i = 0;i<mp.size();i++){
pq.push(pll(dist[i],i));
}
while(!pq.empty()){
auto [d,now] = pq.top();
pq.pop();
if(vis[now])continue;
//cerr<<now<<":"<<d<<endl;
vis[now] = true;
for(auto [nxt,w]:paths[now]){
if(vis[nxt])continue;
if(d+w<dist[nxt]){
dist[nxt] = d+w;
pq.push(pll(d+w,nxt));
}
}
}
return;
}
}
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) {
all.push_back(0);
N = x.size();
for(auto &i:H)all.push_back(i);
for(auto &i:y)all.push_back(i);
sort(_all(all));
all.resize(unique(_all(all))-all.begin());
for(int i = 0;i<N;i++){
for(int j = 0;j<all.size();j++)mp[pii(i,j)] = mp.size();
}
assert(mp.size()<mxn);
/*
for(auto &i:mp){
cerr<<i.fs.fs<<','<<all[i.fs.sc]<<":"<<i.sc<<endl;
}
*/
for(int i = 0;i<N;i++){
for(int j = 0;j<all.size();j++){
for(int k = j+1;k<all.size();k++){
int a = mp[pii(i,j)],b = mp[pii(i,k)];
paths[a].push_back(pii(b,abs(all[j]-all[k])));
paths[b].push_back(pii(a,abs(all[j]-all[k])));
}
}
}
for(int i = 0;i<l.size();i++){
int s = l[i],e = r[i],h = y[i];
h = lower_bound(_all(all),h)-all.begin();
assert(all[h] == y[i])
pii pre = pii(s,h);
for(int j = s+1;j<=e;j++){
if(H[j]<all[h])continue;
pii now = pii(j,h);
int a = mp[pre],b = mp[now];
assert(x[now.fs]>=x[pre.fs]);
paths[a].push_back(pii(b,x[now.fs]-x[pre.fs]));
paths[b].push_back(pii(a,x[now.fs]-x[pre.fs]));
pre = now;
}
}
fill(dist,dist+mxn,inf);
dist[mp[pii(s,0)]] = 0;
//cerr<<mp[pii(s,0)]<<','<<mp[pii(g,0)]<<endl;
DIJKSTRA::GO();
return dist[mp[pii(g,0)]];
}