# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18644 | ggoh | Crocodile's Underground City (IOI11_crocodile) | C++98 | 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 "crocodile.h"
#include "crocodilelib.h"
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
int a,b,c;
long long D[100003][2];
struct A{
int to,cost;
};
std::vector<A>G[100003];
struct B{
int pos;long long min;
};
std::priority_queue<B>PQ;
bool operator<(B aa,B bb){return aa.min>bb.min;}
int travel_plan(int N,int M,int R[][2],int L[],int K,int P[])
{
a=N;
b=M;
c=K;
for(int i=0;i<b;i++)
{
G[R[i][0]].push_back({R[i][1],L[i]});
G[R[i][1]].push_back({R[i][0],L[i]});
}
long long X=1e9;
int u,l;