제출 #984931

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
984931		javotaz	사이버랜드 (APIO23_cyberland)	C++17	49 / 100	276 ms	15700 KiB

cyberland

// In the Name of Allah

#include<bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")

typedef long long ll;
typedef pair<double, int> pd;

#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define pp pop_back
#define all(x) x.begin(), x.end()

const int N = 1e5 + 12, K = 77;
vector<pii> g[N];
int n, m, k, h, a[N];
double ans;
bool mrk[N][K], t[N]; 

void dfs(int u) {
	t[u] = true;
	if (u == h)
		return;
	for (auto i: g[u])
		if (!t[i.F])
			dfs(i.F);
}

void find_ans() {
	dfs(0);
	ans = 1e18;
	if (!t[h]) { 
		ans = -1;
		return;
	}
	priority_queue<pd, vector<pd>, greater<pd>> q;
	q.push({0, 0});
	for (int i = 1; i < n; i++)
		if (!a[i] && t[i])
			q.push({0, i});
	while (!q.empty()) {
		auto tmp = q.top();
		q.pop();
		int u = tmp.S % n, ck = tmp.S / n;
		double w = tmp.F;
		if (u == h) {
			ans = min(ans, w);
			mrk[u][ck] = true;
		}
		if (mrk[u][ck])
			continue;
		mrk[u][ck] = true;
		for (auto i: g[u])
			if (a[i.F]) {
				if (!mrk[i.F][ck])
					q.push({w + i.S, i.F + ck * n});
				if (ck + 1 <= k && a[i.F] == 2 && !mrk[i.F][ck + 1])
					q.push({(w + i.S) / 2.0, i.F + (ck + 1) * n});
			}
	}
}

double solve(int ns, int ms, int ks, int hs, vector<int> xs, vector<int> ys, vector<int> ws, vector<int> as) {
	n = ns, m = ms, k = min(ks, 75), h = hs;
	for (int i = 0; i < m; i++)
		g[xs[i]].pb({ys[i], ws[i]}), g[ys[i]].pb({xs[i], ws[i]});
	for (int i = 0; i < n; i++)
		a[i] = as[i];
	find_ans();
	for (int i = 0; i < n; i++) {
		g[i].clear();
		t[i] = false;
		for (int j = 0; j <= k; ++j)
			mrk[i][j] = false;
	}
	return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 0 / 19
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3