oj.uz

답안 #582762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
582762 2022-06-24T11:43:27 Z 1ne 악어의 지하 도시 (IOI11_crocodile) C++14
0 / 100
 1 ms 340 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	vector<vector<pair<int,int>>>adj(N);
	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]});
	}
	const int maxn = 1e9;
	vector<vector<int>>dist(N,vector<int>(2,maxn));
	priority_queue<pair<int,int>>q;
	for (int i = 0;i<K;++i){
		q.push({0,P[i]});
		dist[P[i]][0] = 0;
		dist[P[i]][1] = 0;
	}
	while(!q.empty()){
		auto u = q.top();
		q.pop();
		for (auto x:adj[u.second]){
			if (dist[x.first][0] > -u.first + x.second){
				dist[x.first][1] = dist[x.first][0];
				dist[x.first][0] = -u.first + x.second;
				q.push({-dist[x.first][1],x.first});
			}
			else if (dist[x.first][1] > -u.first + x.second){
				dist[x.first][1] = -u.first + x.second;
				q.push({-dist[x.first][1],x.first});
			}
		}
	}
	return dist[0][1];
}

Subtask #1
0 / 46.0

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

Subtask #2
0 / 43.0

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

Subtask #3
0 / 11.0

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