oj.uz

Submission #984909

# Submission time Handle Problem Language Result Execution time Memory
984909 2024-05-17T08:11:31 Z javotaz Cyberland (APIO23_cyberland) C++17
0 / 100
 190 ms 14436 KB 
// 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 = 76;
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 = -1;
	if (!t[h]) 
		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) {
			if (ans == -1)
				ans = w;
			else
				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] && !mrk[i.F][ck + (a[i.F] == 2)]) 
				if (a[i.F] == 1)
					q.push({w + i.S, i.F + ck * n});
				else if (ck + 1 <= k)
					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();
		for (int j = 0; j <= k; ++j)
			mrk[i][j] = false;
	}
	return ans;
}

Compilation message

cyberland.cpp: In function 'void find_ans()':
cyberland.cpp:60:7: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   60 |    if (a[i.F] && !mrk[i.F][ck + (a[i.F] == 2)])
      |       ^

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4700 KB Correct.
2 Incorrect 18 ms 6612 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 14436 KB Correct.
2 Incorrect 16 ms 6744 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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