| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 388597 | mariowong | Crocodile's Underground City (IOI11_crocodile) | C++14 | 945 ms | 100460 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 <bits/stdc++.h>
using namespace std;
struct edge{
	int node;
	long long w;
}nw,now;
int ans;
vector <edge> e[100005];
priority_queue <pair<long long,int>  > q;
bool vis[100005][5];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
	for (int i=0;i<M;i++){
		now.w=L[i];
		now.node=R[i][0];	e[R[i][1]].push_back(now);
		now.node=R[i][1];	e[R[i][0]].push_back(now);
	}
	for (int i=0;i<K;i++){
		q.push(make_pair(0,P[i]));
		q.push(make_pair(0,P[i]));
	}
	while (!q.empty()){
		now.w=-q.top().first; now.node=q.top().second;
		if (!vis[now.node][0])
		vis[now.node][0]=true;
		else
		if (!vis[now.node][1]){
			vis[now.node][1]=true;
			if (now.node == 0) ans=now.w;
			for (int i=0;i<e[now.node].size();i++){
				if (!vis[e[now.node][i].node][1])
				q.push(make_pair(-(now.w+e[now.node][i].w),e[now.node][i].node));
			}
		}
		q.pop();
	}
	return ans;
}
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... | ||||
