| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 330302 | NhatMinh0208 | 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.
/*
Normie's Template v2.0
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
#include "crocodile.h"
ll n,m,i,j,k,u,v;
vector<pii(ll)> gt[100001];
ll dis[100001],cnt[100001];
struct cmp
{
int operator()(pii(ll) a, pii(ll) b)
{
return (a.se>b.se);
}
};
priority_queue<pii(ll),vector<pii(ll)>,cmp> se;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
n=N;
m=M;
for (i=0;i<m;i++)
{
gt[R[i][0]].push_back({R[i][1],L[i]});
gt[R[i][1]].push_back({R[i][0],L[i]});
}
k=K;
for (i=0;i<n;i++) dis[i]=1e18;
for (i=0;i<k;i++)
{
dis[P[i]]=0;
cnt[P[i]]=1;
se.push({P[i],0});
}
while(se.size())
{
pii(ll) pp=se.top();
se.pop();
cnt[pp.fi]++;
if (cnt[pp.fi]==2)
{
dis[pp.fi]=pp.se;
for (pii(ll) g : pp.fi)
{
se.push({g.fi,dis[pp.fi]+g.se});
}
}
}
return dis[0];
}