| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 257470 | tinjyu | Sky Walking (IOI19_walk) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "walk.h"
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
struct node{
long long int dis,id;
}t[10000005];
struct Node{
long long int id,h;
}tmp[3000005];
int p[10000005],hp[10000005],m,n,road[10000005],map[30000005][3],cntp,pointer[100005],data[30000005][3],num[100005],cont,st,cnt;
long long int dis[1000005]
int connect(int a,int b,long long int len)
{
//cout<<a<<" "<<b<<" "<<len<<endl;
cont++;
map[cont][0]=b;
map[cont][1]=road[a];
map[cont][2]=len;
road[a]=cont;
cont++;
map[cont][0]=a;
map[cont][1]=road[b];
map[cont][2]=len;
road[b]=cont;
return 0;
}
struct cmp{
bool operator()(const node &a,const node &b)
{
return a.dis>b.dis;
}
};
int dijk()
{
for(int i=1;i<=cnt;i++)dis[i]=100000000000000;
dis[st]=0;
t[1].id=st;
t[1].dis=0;
long long int pp=1;
while(pp>=1)
{
pop_heap(t+1,t+pp+1,cmp());
long long int x=t[pp].id,len=t[pp].dis;
pp--;
if(len!=dis[x])
{
continue;
}
//cout<<x<<" "<<len<<" "<<p[x]<<endl;
long long int g=road[x];
while(g!=-1){
long long int now=map[g][0];
//cout<<now<<" "<<dis[now]<<" "<<p[now]<<" "<<hp[now]<<endl;
if(len+map[g][2]<dis[now]){
dis[now]=len+map[g][2];
pp++;
t[pp].id=now;
t[pp].dis=dis[now];
push_heap(t+1,t+pp+1,cmp());
}
g=map[g][1];
}
//cout<<endl;
}
return 0;
}
bool cmp2(Node a,Node b)
{
return a.h<b.h;
}
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) {
n=x.size();
m=l.size();
for(int i=0;i<=min((long long int)10000000,n*m);i++)road[i]=-1;
for(int i=0;i<n;i++)pointer[i]=-1;
st=0;
for(int i=0;i<m;i++){
cnt++;
num[l[i]]++;
p[cnt]=l[i];
hp[cnt]=y[i];
cntp++;
data[cntp][0]=cnt;
data[cntp][1]=y[i];
data[cntp][2]=pointer[l[i]];
pointer[l[i]]=cntp;
long long int pr=cnt,prex=x[l[i]];
for(int j=l[i]+1;j<=r[i];j++){
if(h[j]>=y[i])
{
cnt++;
cntp++;
data[cntp][0]=cnt;
data[cntp][1]=y[i];
data[cntp][2]=pointer[j];
pointer[j]=cntp;
connect(cnt,pr,x[j]-prex);
pr=cnt;
prex=x[j];
}
}
}
cnt++;
st=cnt;
cntp++;
data[cntp][0]=cnt;
data[cntp][1]=0;
data[cntp][2]=pointer[s];
pointer[s]=cntp;
cnt++;
cntp++;
data[cntp][0]=cnt;
data[cntp][1]=0;
data[cntp][2]=pointer[g];
pointer[g]=cntp;
for(int i=0;i<n;i++)
{
long long int g=pointer[i],tmpcount=0;
while(g!=-1)
{
tmpcount++;
tmp[tmpcount].id=data[g][0];
tmp[tmpcount].h=data[g][1];
g=data[g][2];
}
sort(tmp+1,tmp+tmpcount+1,cmp2);
//for(int j=1;j<=tmpcount;j++)cout<<tmp[j].id<<" "<<tmp[j].h<<" ";
//cout<<endl;
for(int j=1;j<tmpcount;j++)
{
connect(tmp[j].id,tmp[j+1].id,tmp[j+1].h-tmp[j].h);
}
//cout<<endl;
}
dijk();
if(dis[cnt]==100000000000000)return -1;
return dis[cnt];
}