oj.uz

Submission #985736

# Submission time Handle Problem Language Result Execution time Memory
985736 2024-05-18T15:18:36 Z siewjh Cyberland (APIO23_cyberland) C++17
44 / 100
 53 ms 94028 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 (!vis[x]) continue;
		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 23 ms 3932 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 6732 KB Correct.
2 Correct 26 ms 6600 KB Correct.
3 Correct 26 ms 6692 KB Correct.
4 Correct 25 ms 6524 KB Correct.
5 Correct 26 ms 6764 KB Correct.
6 Correct 32 ms 17488 KB Correct.
7 Correct 37 ms 17576 KB Correct.
8 Correct 14 ms 28204 KB Correct.
9 Correct 26 ms 4572 KB Correct.
10 Correct 25 ms 4552 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 6716 KB Correct.
2 Correct 25 ms 6772 KB Correct.
3 Correct 22 ms 6356 KB Correct.
4 Correct 24 ms 4444 KB Correct.
5 Correct 24 ms 4556 KB Correct.
6 Correct 7 ms 14760 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 73244 KB Correct.
2 Incorrect 24 ms 6976 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 6736 KB Correct.
2 Correct 34 ms 6740 KB Correct.
3 Correct 36 ms 6732 KB Correct.
4 Correct 34 ms 17664 KB Correct.
5 Correct 30 ms 4424 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 6764 KB Correct.
2 Correct 21 ms 6700 KB Correct.
3 Correct 53 ms 94028 KB Correct.
4 Correct 17 ms 13148 KB Correct.
5 Correct 24 ms 4696 KB Correct.
6 Correct 23 ms 6748 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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