| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 986315 | Pyqe | Crocodile's Underground City (IOI11_crocodile) | C++17 | 358 ms | 93776 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;
#define mp make_pair
#define fr first
#define sc second
long long nr[100069][2];
vector<pair<long long,long long>> al[100069];
priority_queue<pair<long long,long long>> pq;
bitset<100069> vtd;
int travel_plan(int n,int m,int aa[][2],int wa[],int d,int ex[])
{
	long long i,j,ii,k,l,w,sz,ww;
	
	for(i=0;i<m;i++)
	{
		al[aa[i][0]].push_back({aa[i][1],wa[i]});
		al[aa[i][1]].push_back({aa[i][0],wa[i]});
	}
	for(i=0;i<n;i++)
	{
		for(ii=0;ii<2;ii++)
		{
			nr[i][ii]=1e18;
		}
	}
	for(i=0;i<d;i++)
	{
		pq.push({0,ex[i]});
		nr[ex[i]][0]=0;
		nr[ex[i]][1]=0;
	}
	for(;!pq.empty();)
	{
		k=pq.top().sc;
		w=-pq.top().fr;
		pq.pop();
		if(!k)
		{
			break;
		}
		if(vtd[k])
		{
			continue;
		}
		vtd[k]=1;
		sz=al[k].size();
		for(i=0;i<sz;i++)
		{
			l=al[k][i].fr;
			ww=al[k][i].sc;
			for(ii=0;ii<2;ii++)
			{
				if(w+ww<=nr[l][ii])
				{
					for(j=1;j>ii;j--)
					{
						nr[l][j]=nr[l][j-1];
					}
					nr[l][ii]=w+ww;
					if(nr[l][1]<1000000000000000000)
					{
						pq.push({-nr[l][1],l});
					}
					break;
				}
			}
		}
	}
	return w;
}
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... | ||||
