oj.uz

Submission #988220

# Submission time Handle Problem Language Result Execution time Memory
988220 2024-05-24T10:09:19 Z BF001 Crocodile's Underground City (IOI11_crocodile) C++17
100 / 100
 420 ms 76596 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]){
				if (d1[v] != oo && d1[v] != d2[v]){
					q.push({d1[v], v});
				}
				d2[v] = d1[v];
				d1[v] = du + dv;
			}
			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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 7056 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 2 ms 7000 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 7000 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 7056 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 2 ms 7000 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 7000 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 9052 KB Output is correct
10 Correct 2 ms 6772 KB Output is correct
11 Correct 3 ms 6900 KB Output is correct
12 Correct 5 ms 9308 KB Output is correct
13 Correct 6 ms 9308 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 7056 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 2 ms 7000 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 7000 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 9052 KB Output is correct
10 Correct 2 ms 6772 KB Output is correct
11 Correct 3 ms 6900 KB Output is correct
12 Correct 5 ms 9308 KB Output is correct
13 Correct 6 ms 9308 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct
16 Correct 348 ms 70776 KB Output is correct
17 Correct 60 ms 18540 KB Output is correct
18 Correct 72 ms 20840 KB Output is correct
19 Correct 420 ms 76596 KB Output is correct
20 Correct 235 ms 59508 KB Output is correct
21 Correct 29 ms 14968 KB Output is correct
22 Correct 240 ms 55120 KB Output is correct