# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335082 | daniel920712 | 철로 (IOI14_rail) | C++14 | 282 ms | 620 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 "rail.h"
#include <stdio.h>
#include <stdlib.h>
#include <queue>
#include <utility>
#include <stack>
using namespace std;
stack < pair < pair < int , int > , pair < int , int > > > all;
bool have[5005];
int dis[5005];
void findLocation(int N, int first, int location[], int stype[])
{
int x,y,z,i,j,t,w;
location[0]=first;
stype[0]=1;
all.push(make_pair(make_pair(0,0),make_pair(0,-1)));
for(i=0;i<N;i++) dis[i]=2e9;
while(!all.empty())
{
y=all.top().first.first;
x=all.top().second.first;
z=all.top().second.second;
w=all.top().first.second;
all.pop();
if(have[x]) continue;
have[x]=1;
if(z!=-1)
{
if(stype[z]==1)
{
stype[x]=2;
location[x]=location[z]+w;
}
else
{
stype[x]=1;
location[x]=location[z]-w;
}
}
for(auto i=0;i<N;i++)
{
if(have[i]) continue;
t=getDistance(x,i);
if(y+t<=dis[i])
{
dis[i]=y+t;
all.push(make_pair(make_pair(y+t,t),make_pair(i,x)));
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |