oj.uz

Submission #985732

# Submission time Handle Problem Language Result Execution time Memory
985732 2024-05-18T15:16:48 Z siewjh Cyberland (APIO23_cyberland) C++17
44 / 100
 58 ms 93068 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef tuple<ld, int, int> t3;
const int MAXN = 100005;
const ld inf = 1e18;
vector<pair<int, int>> adj[MAXN];
bool vis[MAXN], conn[MAXN];
ld dist[MAXN][70], pwr[70];

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){
	K = min(K, 68);
	pwr[0] = 1;
	for (int i = 1; i <= 68; i++) pwr[i] = pwr[i - 1] / 2;
	for (int i = 0; i < N; i++){
		adj[i].clear(); vis[i] = 0; conn[i] = 0;
		for (int j = 0; j <= K; j++) dist[i][j] = inf;
	}
	for (int i = 0; i < M; i++){
		adj[x[i]].push_back({y[i], c[i]});
		adj[y[i]].push_back({x[i], c[i]});
	}
	queue<int> q;
	q.push(0); vis[0] = 1; conn[0] = 1;
	while (!q.empty()){
		int x = q.front(); q.pop();
		if (x == H) continue;
		if (arr[x] == 0) conn[x] = 1;
		for (auto &[nn, nd] : adj[x])
			if (!vis[nn]){
				q.push(nn); vis[nn] = 1;
			}
	}
	priority_queue<t3, vector<t3>, greater<t3>> pq;
	pq.push({0, H, 0}); dist[H][0] = 0;
	while (!pq.empty()){
		ld d; int x, use; tie(d, x, use) = pq.top(); pq.pop();
		if (dist[x][use] < d) continue;
		if (conn[x]) return d;
		for (auto &[nn, nd] : adj[x]){
			ld fd = d + nd * pwr[use];
			if (dist[nn][use] > fd){
				dist[nn][use] = fd;
				pq.push({dist[nn][use], nn, use});
			}
			if (arr[nn] == 2 && use < K && dist[nn][use + 1] > fd){
				dist[nn][use + 1] = fd;
				pq.push({dist[nn][use + 1], nn, use + 1});
			}
		}
	}
	return -1;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 3672 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5976 KB Correct.
2 Correct 24 ms 5976 KB Correct.
3 Correct 23 ms 5980 KB Correct.
4 Correct 25 ms 5980 KB Correct.
5 Correct 25 ms 6260 KB Correct.
6 Correct 22 ms 16748 KB Correct.
7 Correct 28 ms 16732 KB Correct.
8 Correct 14 ms 27740 KB Correct.
9 Correct 33 ms 3676 KB Correct.
10 Correct 32 ms 3676 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 5980 KB Correct.
2 Correct 24 ms 5980 KB Correct.
3 Correct 22 ms 5976 KB Correct.
4 Correct 24 ms 3676 KB Correct.
5 Correct 24 ms 3676 KB Correct.
6 Correct 6 ms 14428 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 73044 KB Correct.
2 Incorrect 24 ms 5976 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 5980 KB Correct.
2 Correct 27 ms 6052 KB Correct.
3 Correct 26 ms 5980 KB Correct.
4 Correct 35 ms 16896 KB Correct.
5 Correct 23 ms 3676 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5980 KB Correct.
2 Correct 23 ms 6080 KB Correct.
3 Correct 58 ms 93068 KB Correct.
4 Correct 18 ms 12596 KB Correct.
5 Correct 26 ms 3828 KB Correct.
6 Correct 25 ms 6020 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 6060 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 6144 KB Wrong Answer.
2 Halted 0 ms 0 KB -