oj.uz

답안 #756613

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756613 2023-06-12T01:55:16 Z penguin133 악어의 지하 도시 (IOI11_crocodile) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
 
//#define int long long
#define pi pair<long long, long long>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	vector <pi> adj[N + 5];
	long long dist[N+5][2];
	for(int i=0;i<=N;i++)dist[i][0] = dist[i][1] = 1e10;
	for(int i=0;i<M;i++){
		adj[R[i][0]].push_back({R[i][1], L[i]});
		adj[R[i][1]].push_back({R[i][0], L[i]});
	}
	priority_queue <pi, vector<pi>, greater<pi> > pq;
	for(int i=0;i<K;i++){
		dist[P[i]][0] = 0;
		pq.push({0, P[i]});
	}
	while(!pq.empty()){
		long long x = pq.top().fi, y = pq.top().se;
		pq.pop();
		if(dist[y][1] != x)continue;
		for(auto [i, j] : adj[y]){
			if(dist[i][0] > x + j){
				dist[i][1] = dist[i][0];
				dist[i][0] = x + j;
				if(dist[i][1] != 1e10)pq.push({dist[i][1], i});
			}
			else if(dist[i][1] > x + j){
				dist[i][1] = x + j;
				pq.push({dist[i][1], i});
			}
		}
	}
	return dist[0][1];
}

Subtask #1
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -