oj.uz

Submission #207578

# Submission time Handle Problem Language Result Execution time Memory
207578 2020-03-08T04:48:36 Z aloo123 Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 5 ms 248 KB 
#include <bits/stdc++.h>
 #include <crocodile.h>
#define ll int
#define pb push_back
#define mp make_pair
#define s second
#define f first
using namespace std;
#define pii pair<int,int>
const int INF = INT_MAX;
int travel_plan(int n,int m,int r[][2],int l[],int k,int p[]){
	vector<pii> adj[n];
	for(int i =0;i<m;i++){
		int u = r[i][0];
		int v = r[i][1];
		int d = l[i];
		adj[u].push_back(make_pair(u,d));
		adj[v].push_back(make_pair(v,d));
	}
	pii dis[n];
	for(int i =0;i<n;i++) dis[i] = mp(INF,INF);
	priority_queue<pii,vector<pii>,greater<pii>> pq;
	for(int i =0;i<k;i++){
		ll u = p[i];
		pq.push(mp(0,u));
		dis[u].f = 0;
		dis[u].s = 0;
	}

	while(!pq.empty()){
		pii u = pq.top();
		pq.pop();
		for(auto v:adj[u.s]){
			int vertex = v.f;
			if(dis[vertex].f > dis[u.s].f + v.s){
				dis[vertex].s = dis[vertex].f;
				dis[vertex].f = dis[u.s].f + v.s;
				pq.push(mp(dis[vertex].f,vertex));
			}
		}
	}

	return dis[0].s;

}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -