| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 438047 | adamjinwei | Crocodile's Underground City (IOI11_crocodile) | C++14 | 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 <bits/stdc++.h>
#include "crocodile.h"
#define inf 1000000007
#define mod 1000000007
#define rnd() rand_num()
#define bigrnd() dis(rand_num)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#define int long long
using namespace std;
unsigned sed=std::chrono::system_clock::now().time_since_epoch().count();
mt19937 rand_num(sed);
uniform_int_distribution<long long> dis(0,inf);
template <typename T> void read(T &x){
x=0;char ch=getchar();int fh=1;
while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
x*=fh;
}
template <typename T> void write(T x) {
if (x<0) x=-x,putchar('-');
if (x>9) write(x/10);
putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
write(x);
puts("");
}
int n;
int h[100005],e[2000005],w[2000005],ne[2000005],idx;
int dist[100005][2];
void add(int a,int b,int c)
{
e[idx]=b,w[idx]=c,ne[idx]=h[a],h[a]=idx++;
}
int travel_plan(int N,int M,int R[][2],int L[],int K,int P[])
{
n=N;
memset(h,-1,sizeof(h));
for(int i=0;i<M;++i)
{
add(R[i][0],R[i][1],L[i]);
add(R[i][1],R[i][0],L[i]);
}
memset(dist,0x3f,sizeof(dist));
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
for(int i=0;i<K;++i)
{
dist[P[i]][0]=dist[P[i]][1]=0;
pq.push(make_pair(0,P[i]));
}
while(!pq.empty())
{
pair<int,int> p=pq.top();
pq.pop();
if(dist[p.second][1]!=p.first) continue;
for(int i=h[p.second];~i;i=ne[i])
{
int j=e[i];
if(dist[j][0]>p.first+w[i])
{
dist[j][1]=dist[j][0];
dist[j][0]=p.first+w[i];
pq.push(make_pair(dist[j][1],j));
}
else if(dist[j][1]>p.first+w[i])
{
dist[j][1]=p.first+w[i];
pq.push(make_pair(dist[j][1],j));
}
}
}
return dist[0][1];
}