oj.uz

Submission #765308

# Submission time Handle Problem Language Result Execution time Memory
765308 2023-06-24T10:36:36 Z raysh07 Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 432 ms 76976 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define INF (long long)(1e18 + 1)
#define int long long

int n, m;
const int maxn = 1e5 + 69;
vector <pair<int, int>> adj[maxn];
int dp[maxn][2];

int32_t travel_plan(int32_t N, int32_t M, int32_t R[][2], int32_t L[], int32_t K, int32_t P[])
{
	n = N, m = M;
	for (int i = 0; i < n; i++){
		dp[i][0] = dp[i][1] = INF;
	}

	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]});
	}

	for (int i = 0; i < K; i++){
		dp[P[i]][0] = dp[P[i]][1] = 0;
	}

	//dp[i][0] = best path, dp[i][1] = second best path, update only with help of second best path values 
	priority_queue <pair<int, int>> pq;
	for (int i = 0; i < n; i++){
		pq.push({-dp[i][1], i});
	}

	while (!pq.empty()){
		auto pi = pq.top();
		pq.pop();

		int d = -pi.first;
		int u = pi.second;

		if (d != dp[u][1]) continue;

		for (pair <int, int> pi : adj[u]){
			int v = pi.first;
			int w = pi.second;
			int val = d + w;

			if (val < dp[v][0]){
				dp[v][1] = dp[v][0];
				dp[v][0] = val;
				pq.push({-dp[v][1], v});
			} else if (val < dp[v][1]) {
				dp[v][1] = val;
				pq.push({-dp[v][1], v});
			}
		}
	}

	return (int32_t)dp[0][1];
}

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 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 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 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 3 ms 2772 KB Output is correct
12 Correct 4 ms 3232 KB Output is correct
13 Correct 4 ms 3284 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2772 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 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 3 ms 2772 KB Output is correct
12 Correct 4 ms 3232 KB Output is correct
13 Correct 4 ms 3284 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 327 ms 68928 KB Output is correct
17 Correct 86 ms 18584 KB Output is correct
18 Correct 103 ms 20796 KB Output is correct
19 Correct 432 ms 76976 KB Output is correct
20 Correct 227 ms 55188 KB Output is correct
21 Correct 36 ms 9480 KB Output is correct
22 Incorrect 249 ms 50900 KB Output isn't correct
23 Halted 0 ms 0 KB -