oj.uz

Submission #862810

# Submission time Handle Problem Language Result Execution time Memory
862810 2023-10-19T04:49:44 Z Berryisbetter Cyberland (APIO23_cyberland) C++17
44 / 100
 58 ms 16988 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
const ll INF = 1e16;

vll v; vector<vector<pair<ll, ll>>>g;
ll h,n;
void dfs(ll x) {
	if (v[x]++) return;
	if ((int)x%(int)n==h) return;
	for (auto i : g[x]) {
		dfs(i.first);
	}
}
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
	ll m = M, k = min(K, 0) + 1; h = H, n = N;
	v = vll(n * k); g = vector<vector<pair<ll, ll>>>(n * k);
	for (ll j = 0; j < k; j++) {
		for (ll i = 0; i < m; i++) {
			g[x[i] + j * n].push_back({ y[i] + j * n, c[i] * 1.0 / (1ll << (long long)j) });
			g[y[i] + j * n].push_back({ x[i] + j * n, c[i] * 1.0 / (1ll << (long long)j) });
			if (j && arr[x[i]] == 2) {
				g[x[i] + j * n].push_back({ y[i] + (j - 1) * n, c[i] * 1.0 / (1ll << (long long)j) });
			}
			if (j && arr[y[i]] == 2) {
				g[y[i] + j * n].push_back({ x[i] + (j - 1) * n, c[i] * 1.0 / (1ll << (long long)j) });
			}
		}
	}
	for (ll i = 0; i < k; i++) {
		dfs(i * n);
	}
	vll save = v;
	v = vll(n * k, INF);
	priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> q;
	for (ll i = 0; i < k; i++) {
		q.push({ 0,i*n }); v[i*n] = 0;

	}
	for (ll j = 0; j < k; j++) {
		for (ll i = 0; i < n; i++) {
			if (arr[i] == 0&&save[i+j*n]) {
				q.push({ 0, i + j * n });
				v[i + j * n] = 0;
			}
		}
	}
	save = vll(n*k);
	while (q.size()) {
		ll ce= q.top().second; q.pop();
		if (((int)ce%(int)n)==h) {
			continue;
		}
		if (!save[ce]++) {
			for (auto i : g[ce]) {
				if (v[i.first] > v[ce] + i.second) {
					v[i.first] = v[ce] + i.second;
					q.push({ v[i.first],i.first });
				}
			}
		}
	}
	if (v[h] == INF) {
		return -1;
	}
	return v[h];
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 604 KB Correct.
2 Correct 40 ms 604 KB Correct.
3 Correct 38 ms 600 KB Correct.
4 Correct 39 ms 604 KB Correct.
5 Correct 41 ms 848 KB Correct.
6 Correct 34 ms 2236 KB Correct.
7 Correct 46 ms 2240 KB Correct.
8 Correct 19 ms 4136 KB Correct.
9 Correct 37 ms 528 KB Correct.
10 Correct 37 ms 344 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 604 KB Correct.
2 Correct 46 ms 600 KB Correct.
3 Correct 43 ms 600 KB Correct.
4 Correct 45 ms 604 KB Correct.
5 Correct 45 ms 780 KB Correct.
6 Correct 10 ms 2396 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 600 KB Correct.
2 Correct 33 ms 1720 KB Correct.
3 Correct 33 ms 1612 KB Correct.
4 Correct 31 ms 3344 KB Correct.
5 Correct 30 ms 1364 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 604 KB Correct.
2 Correct 34 ms 1580 KB Correct.
3 Correct 58 ms 16988 KB Correct.
4 Correct 24 ms 2912 KB Correct.
5 Correct 39 ms 1372 KB Correct.
6 Correct 37 ms 1628 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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