Submission #94007

#	Time	Username	Problem	Language	Result	Execution time	Memory
94007		fjzzq2002	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	629 ms	54136 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
#define SZ 2000555
typedef pair<int,int> pii;
typedef long long ll;
#define fi first
#define se second
namespace Wrap
{
Edgc
int g[SZ],cn[SZ];
}
int travel_plan(int N, int M_, int R[][2], int L[], int K, int P[])
{
	using namespace Wrap;
	for(int i=0;i<M_;++i)
		adde(R[i][0],R[i][1],L[i]);
	priority_queue<pii,vector<pii>,greater<pii> > pq;
	for(int i=0;i<K;++i)
	{
		int x=P[i]; cn[x]=3;
		for esb(x,e,b)
			pq.push(pii(vc[e],b));
		if(x==0) return 0;
	}
	while(!pq.empty())
	{
		pii x=pq.top(); pq.pop();
		if(cn[x.se]>=2) continue;
		++cn[x.se];
		if(cn[x.se]<2) continue;
		g[x.se]=x.fi;
		if(x.se==0) return x.fi;
		for esb(x.se,e,b)
			pq.push(pii(x.fi+vc[e],b));
	}
	return -1;
}

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11