oj.uz

Submission #990616

# Submission time Handle Problem Language Result Execution time Memory
990616 2024-05-30T17:27:14 Z OAleksa Cyberland (APIO23_cyberland) C++17
49 / 100
 3000 ms 51364 KB 
#include "cyberland.h"
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
//g++ cyberland.cpp cyberland.h stub.cpp
const int N = 1e5 + 69;
const long double inf = 1e18;
vector<pair<long long, long long>> g[N];
long double dis[N][33];
int vis[N], b[N];
void dfs(int v) {
	vis[v] = 1;
	for (auto u : g[v]) {
		if (vis[u.f])
			continue;
		if (b[u.f] == 0) {
			for (int j = 0;j <= 30;j++)
				dis[u.f][j] = 0;
		}
		else if (b[u.f] == 2) {
			for (int j = 0;j <= 30;j++) {
				dis[u.f][j] = min(dis[u.f][j], dis[v][j] + u.s);
				if (j < 30)
					dis[u.f][j + 1] = min(dis[u.f][j + 1], (dis[v][j] + u.s) / 2);
			}
		}
		else {
			for (int j = 0;j <= 30;j++) 
				dis[u.f][j] = min(dis[u.f][j], dis[v][j] + u.s);
		}
		dfs(u.f);
	}
}
double solve(int n, int m, int k, int s, vector<int> x, vector<int> y, vector<int> c, vector<int> a) {
	//reset
	for (int i = 0;i < n;i++) {
		g[i].clear();
		b[i] = a[i];
		vis[i] = 0;
	}
	int ok = 1;
	for (int i = 0;i < m;i++) {
		g[x[i]].push_back({y[i], c[i]});
		g[y[i]].push_back({x[i], c[i]});
		ok &= (x[i] + 1 == y[i]);
	}
	for (int i = 0;i < n;i++) {
		for (int j = 0;j <= k;j++)
			dis[i][j] = inf;
	}
	dis[0][0] = 0;
	if (ok && m == n - 1) {
		long double ans = inf;
		dfs(0);
		for (int i = 0;i <= k;i++)
			ans = min(ans, dis[s][i]);
		if (ans >= inf)
			ans = -1;
		assert(ans != -1);
		return ans;
	}
	priority_queue<tuple<double, int, int>> pq;
	pq.push({0, 0, 0});
	while (!pq.empty()) {
		auto x = pq.top();
		pq.pop();
		int v, j;
		double d;
		tie(d, v, j) = x;
		d = abs(d);
		if (a[v] == 0) {
			for (int j = 0;j <= k;j++)
				dis[v][j] = 0;
			d = 0;
		}
		for (auto u : g[v]) {
			if (dis[u.f][j] > d + u.s) {
				dis[u.f][j] = d + u.s;
				if (u.f != s)
					pq.push({-dis[u.f][j], u.f, j});
			}
			if (a[u.f] == 2) {
				if (j < k && dis[u.f][j + 1] > (d + u.s) / 2) {
					dis[u.f][j + 1] = (d + u.s) / 2;
					if (u.f != s)
						pq.push({-dis[u.f][j + 1], u.f, j + 1});
				}
			}
		}
	}
	long double ans = inf;
	for (int i = 0;i <= k;i++)
		ans = min(ans, dis[s][i]);
	if (ans == inf)
		ans = -1;
	return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5976 KB Correct.
2 Correct 19 ms 5980 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 5980 KB Correct.
2 Correct 27 ms 5976 KB Correct.
3 Correct 25 ms 5960 KB Correct.
4 Correct 26 ms 5980 KB Correct.
5 Correct 26 ms 6016 KB Correct.
6 Correct 23 ms 10916 KB Correct.
7 Correct 30 ms 10844 KB Correct.
8 Correct 15 ms 17756 KB Correct.
9 Correct 25 ms 5720 KB Correct.
10 Correct 24 ms 5724 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5976 KB Correct.
2 Correct 28 ms 5980 KB Correct.
3 Correct 26 ms 5976 KB Correct.
4 Correct 26 ms 5724 KB Correct.
5 Correct 26 ms 5724 KB Correct.
6 Correct 7 ms 10584 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5980 KB Correct.
2 Correct 25 ms 5976 KB Correct.
3 Correct 25 ms 5976 KB Correct.
4 Correct 24 ms 11100 KB Correct.
5 Correct 22 ms 5916 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5976 KB Correct.
2 Correct 23 ms 6148 KB Correct.
3 Correct 48 ms 51364 KB Correct.
4 Correct 23 ms 10960 KB Correct.
5 Correct 28 ms 5724 KB Correct.
6 Correct 25 ms 5980 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3061 ms 18168 KB Time limit exceeded
2 Halted 0 ms 0 KB -