oj.uz

답안 #108301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108301 2019-04-28T13:21:07 Z SecretAgent007 악어의 지하 도시 (IOI11_crocodile) C++17
89 / 100
 974 ms 77928 KB 
#include <bits/stdc++.h>
using namespace std;

//#define int long long 

const long long INF = 1e18;

int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
	
	vector< vector< pair<long long, long long> > > Graph(n);
	
	for(int i = 0; i < m; i++){
		Graph[r[i][0]].push_back(make_pair(l[i], r[i][1]));
		Graph[r[i][1]].push_back(make_pair(l[i], r[i][0]));
	}
	
	priority_queue< pair<long long, long long>, vector< pair<long long, long long> >, greater< pair<long long, long long> > > pq;
	
	vector< vector< long long > > dist(n, vector<long long>(2, INF));
	
	for(int i = 0; i < k; i++){
		dist[p[i]][0] = dist[p[i]][1] = 0;
		pq.push(make_pair(0,p[i]));
	}
	
	while(!pq.empty()){
		pair<long long, long long> pa = pq.top();
		pq.pop();
		
		long long cost = pa.first;
		int node = pa.second;
		
		if(dist[node][1] != cost) continue;
		
		for(auto a : Graph[node]){
		
			if(dist[a.second][0] > a.first + cost){
				dist[a.second][1] = dist[a.second][0];
				dist[a.second][0] = a.first+cost;
				pq.push(make_pair(dist[a.second][1], a.second)); 
			}else if(dist[a.second][1] > a.first+cost){
				dist[a.second][1] = a.first+cost;
				pq.push(make_pair(dist[a.second][1], a.second));
			}
		
		}
		
	}
	
	return dist[0][1];
}

Subtask #1
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 8 ms 1128 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 512 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 8 ms 1128 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 752 ms 67464 KB Output is correct
17 Correct 130 ms 20592 KB Output is correct
18 Correct 175 ms 22000 KB Output is correct
19 Correct 974 ms 77928 KB Output is correct
20 Correct 359 ms 52816 KB Output is correct
21 Correct 61 ms 8568 KB Output is correct
22 Incorrect 436 ms 50016 KB Output isn't correct