| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 151481 | Nucleist | Sky Walking (IOI19_walk) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "walk.h"
using namespace std;
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
struct greateri
{
template<class T>
bool operator()(T const &a, T const &b) const { return a > b; }
};
ll so,go;
ll n,m;
vector<pair<ll,pair<ll,ll>>>graph[100001];
map<ll,pair<ll,ll>>gg;
map<pair<ll,ll>,ll>dist;
map<pair<ll,ll>,ll>in_queu;
ll min_distance(vector<ll>x,vector<ll>h,vector<ll>l,vector<ll>r,vector<ll>y,ll s,ll g)
{
for (ll i = 0; i < x.size(); ++i)
{
gg[x[i]]={h[i],i};
}
for (ll i = 0; i < l.size(); ++i)
{
auto k = gg.lower_bound(x[l[i]]);
auto hedi = (*k).first;
auto yo = (*k).second;
vector<pair<ll,ll>>connect;
while(hedi<=x[r[i]] && k!=gg.end())
{
if(yo.first>=y[i])
{
connect.pb({hedi,yo.second});
}
k++;
hedi = (*k).first;
yo = (*k).second;
}
for (ll j = 0; j < connect.size(); ++j)
{
for (ll d = j+1; d < connect.size(); ++d)
{
ll node = connect[j].second;
ll node1 = connect[d].second;
ll weight = abs(connect[d].first-connect[j].first);
graph[node].pb({node1,{y[i],weight}});
graph[node1].pb({node,{y[i],weight}});
}
}
}
queue<pair<ll,ll>>now;
now.push({s,0});
dist[{s,0}]=0;
ll ans=INF;
while(!now.empty())
{
auto ni = now.front();
//debug(ni.first);
now.pop();
in_queu[ni]=0;
for (ll i = 0; i < graph[ni.first].size(); ++i)
{
ll to = graph[ni.first][i].first;
ll index = graph[ni.first][i].second.first;
if((dist.find({to,index})==dist.end()||(dist[{to,index}]>dist[ni]+abs(ni.second-index)+abs(x[ni.first]-x[to]))))
{
//debug(to);
dist[{to,index}]=dist[ni]+abs(ni.second-index)+abs(x[ni.first]-x[to]);
if(to==go)ans=min(ans,dist[{to,index}]+index);
if(!in_queu[{to,index}] || in_queu.find({to,index})==in_queu.end())
{in_queu[{to,index}]=1,now.push({to,index});}
}
}
}
if(ans==INF)return -1;
return ans;
}
//code the AC sol !
// BS/queue/map