oj.uz

Submission #109142

# Submission time Handle Problem Language Result Execution time Memory
109142 2019-05-04T17:20:25 Z pamaj Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 5 ms 3456 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
const int maxn = 1e5 + 10;

typedef pair<int, int> pii;

int vis[maxn], dist[maxn], dist2[maxn];
vector<pii> G[maxn];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	memset(dist, 0x3f3f3f3f, sizeof(dist));
	memset(dist2, 0x3f3f3f3f, sizeof(dist));

	for(int i = 0; i < M; i++)
	{
		int a = R[i][0], b = R[i][1];

		G[a].push_back({L[i], b});
		G[b].push_back({L[i], a});
	}

	// for(int i = 0; i < N; i++)
	// 	for(auto u : G[i])
	// 		cout << i << " " << u.second << " " << u.first << "\n";

	priority_queue<pii, vector<pii>, greater<pii>> q;

	for(int i = 0; i < K; i++)
	{
		dist[P[i]] = dist2[P[i]] = 0;
		q.push({0, P[i]});
	}

	while(!q.empty())
	{
		auto a = q.top();
		q.pop();

		// cout << a.second << " \n";

		if(vis[a.second]) continue;
		vis[a.second] = true;

		for(auto u : G[a.second])
		{
			if(dist[u.second] > dist2[a.second] + u.first)
			{
				dist[u.second] = dist2[a.second] + u.first;
			}
			else if(dist2[u.second] > dist2[a.second] + u.first)
			{
				dist2[u.second] = dist2[a.second] + u.first;
				q.push({dist2[u.second], u.second});
			}
		}
	}

	return dist2[0];
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 3456 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 3456 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 3456 KB Output isn't correct
2 Halted 0 ms 0 KB -