Submission #126627

#TimeUsernameProblemLanguageResultExecution timeMemory
126627DodgeBallManCrocodile's Underground City (IOI11_crocodile)C++14
0 / 100
4 ms2808 KiB
#include <bits/stdc++.h> #include "crocodile.h" #define pii pair<int, 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; int travel_plan( int n, int m, int r[][2], int l[], int k, int p[] ) { for( int i = 0 ; i < m ; i++ ) { g[r[i][0]].emplace_back( r[i][1], ( long long )l[i] ); g[r[i][1]].emplace_back( r[i][0], ( long long )l[i] ); } for( int 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 ) ); } } }

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...