# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126624 | DodgeBallMan | 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.
#include <bits/stdc++.h>
#include "crocodile.h"
#define pii pair<long long, long long>
#define x first
#define y second
using namespace std;
const int N = 1e5 + 10;
long long cnt[N];
vector<pii> g[N];
priority_queue< pii, vector<pii>, greater<pii> > q;
long long travel_plan( long long n, long long m, long long r[][2], long long l[], long long k, long long p[] )
{
for( long long i = 0 ; i < m ; i++ ) {
g[r[i][0]].emplace_back( r[i][1], l[i] );
g[r[i][1]].emplace_back( r[i][0], l[i] );
}
for( long long i = 0 ; i < k ; i++ ) {
cnt[p[i]]++;
q.push( pii( p[i], 0 ) );
}
while( !q.empty() ) {
pii te = q.top(); q.pop();
cnt[te.x]++;
if( cnt[te.x] != 2 ) continue ;
if( te.x == 0 ) return te.y;
for( pii i : g[te.x] ) if( cnt[i.x] < 2 ) {
q.push( pii( i.x, i.y + te.y ) );
}
}
}
// int main() {
// long long n, m, r[10][2], l[23], k, p[18];
// travel_plan( n, m, r, l, k, p );
// }