oj.uz

Submission #756582

# Submission time Handle Problem Language Result Execution time Memory
756582 2023-06-12T00:52:40 Z pavement Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 479 ms 44840 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

#define eb emplace_back
using ii = pair<int, int>;

int fd[100005], sd[100005];
vector<ii> adj[100005];
priority_queue<ii, vector<ii>, greater<ii> > pq;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
	for (int i = 0; i < M; i++) {
		adj[R[i][0]].eb(R[i][1], L[i]);
		adj[R[i][1]].eb(R[i][0], L[i]);
	}
	for (int i = 0; i < N; i++) {
		fd[i] = sd[i] = (int)2e9;
	}
	for (int i = 0; i < K; i++) {
		fd[P[i]] = sd[P[i]] = 0;
		pq.emplace(0, P[i]);
	}
	while (!pq.empty()) {
		auto [d, v] = pq.top();
		pq.pop();
		if (sd[v] != d) continue;
		if (v == 0) return d;
		for (auto [u, w] : adj[v]) {
			int c = d + w;
			if (c < sd[u]) {
				sd[u] = c;
				if (sd[u] < fd[u]) swap(fd[u], sd[u]);
				if (sd[u] != (int)2e9) pq.emplace(sd[u], u);
			}
		}
	}
	assert(0);
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2580 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2656 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2580 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2656 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 7 ms 3028 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2580 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2656 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 7 ms 3028 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 428 ms 41336 KB Output is correct
17 Correct 62 ms 10440 KB Output is correct
18 Correct 68 ms 11688 KB Output is correct
19 Correct 479 ms 44840 KB Output is correct
20 Correct 272 ms 36640 KB Output is correct
21 Correct 37 ms 6236 KB Output is correct
22 Incorrect 274 ms 31744 KB Output isn't correct
23 Halted 0 ms 0 KB -