oj.uz

답안 #988218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988218 2024-05-24T10:05:42 Z BF001 악어의 지하 도시 (IOI11_crocodile) C++17
89 / 100
 451 ms 81532 KB 
#include <bits/stdc++.h>
using namespace std;

#define NN 100005
#define oo 1e18
#define fi first
#define se second

typedef pair<long long, long long> ii;

long long n, m, k, d1[NN], d2[NN];
vector<long long> sr;
vector<ii> adj[NN];

long long ditra(){
	for (long long i = 0; i <= n; i++) d1[i] = d2[i] = oo;
	priority_queue<ii, vector<ii>, greater<ii>> q;
	for (auto x : sr){
		d2[x] = d1[x] = 0;
		q.push({0, x});
	}
	while (!q.empty()){
		long long u = q.top().se;
		long long du = q.top().fi;
		q.pop();
		if (du != d2[u]) continue;
		for (auto x : adj[u]){
			long long v = x.fi;
			long long dv = x.se;
			if (du + dv < d1[v]){
				d2[v] = d1[v];
				d1[v] = du + dv;
				q.push({d2[v], v});
			}
			else if (du + dv < d2[v]){
				d2[v] = du + dv;
				q.push({d2[v], v});
			}
		}
	}
	return d2[0];
}

long long travel_plan(int  N, int M , int R[][2], int L[], int k, int p[]){
	n = N;
	m = M;
	for (long long i = 0; i < m; i++){
		long long a = R[i][0], b = R[i][1], c = L[i];
		adj[a].push_back({b, c});
		adj[b].push_back({a, c}); 
	}
	for (long long i = 0; i < k; i++){
		sr.push_back(p[i]);
	}
	return ditra();
}

Subtask #1
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6776 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6756 KB Output is correct
6 Correct 3 ms 6744 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6776 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6756 KB Output is correct
6 Correct 3 ms 6744 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 4 ms 9052 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 5 ms 9308 KB Output is correct
13 Correct 5 ms 9304 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6776 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6756 KB Output is correct
6 Correct 3 ms 6744 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 4 ms 9052 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 5 ms 9308 KB Output is correct
13 Correct 5 ms 9304 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 366 ms 73444 KB Output is correct
17 Correct 73 ms 20680 KB Output is correct
18 Correct 104 ms 23028 KB Output is correct
19 Correct 451 ms 81532 KB Output is correct
20 Correct 249 ms 59764 KB Output is correct
21 Correct 39 ms 15572 KB Output is correct
22 Incorrect 253 ms 55768 KB Output isn't correct
23 Halted 0 ms 0 KB -