oj.uz

Submission #1088952

# Submission time Handle Problem Language Result Execution time Memory
1088952 2024-09-15T15:54:56 Z Math4Life2020 Cyberland (APIO23_cyberland) C++17
42 / 100
 3000 ms 2097152 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = int; using pii = pair<ll,ll>;
using ld = double; using vi = vector<int>;

const ld INF = 1e18;

double solve(int N, int M, int K, int H, vi x, vi y, vi c, vi arr) {
	ld tmin[N][K+1];
	bool dfsf[N];
	for (ll i=0;i<N;i++) {
		dfsf[i]=0;
		for (ll k=0;k<=K;k++) {
			tmin[i][k]=INF;
		}
	}
	vector<pii> adj[N]; //vertex,cost
	for (ll i=0;i<M;i++) {
		adj[x[i]].push_back({y[i],c[i]});
		adj[y[i]].push_back({x[i],c[i]});
	}
	stack<int> s;
	s.push(0);
	while (!s.empty()) {
		ll x0 = s.top(); s.pop();
		if (!dfsf[x0]) {
			dfsf[x0]=1;
			if (x0==H) {
				continue;
			}
			for (pii p0: adj[x0]) {
				s.push(p0.first);
			}
		}
	}
	if (!dfsf[H]) {
		return -1.0;
	}
	priority_queue<pair<ld,ll>> pq[K+1]; //{#k,{time,position}}
	pq[0].push({0.0,0});
	for (ll i=0;i<N;i++) {
		if (dfsf[i] && (arr[i]==0)) {
			pq[0].push({0.0,i});
		}
	}
	for (ll k=0;k<=K;k++) {
		while (!pq[k].empty()) {
			auto A = pq[k].top(); pq[k].pop();
			ld T = A.first; ll x0 = A.second;
			if (arr[x0]==0 && T != 0.0) {
				continue;
			}
			if (tmin[x0][k]<=(T+1e-10)) {
				continue;
			}
			tmin[x0][k]=T;
			if (x0==H) {
				continue;
			}
			for (pii p0: adj[x0]) {
				ll y0 = p0.first; ld ce = p0.second;
				pq[k].push({ce+T,y0});
				if (arr[x0]==2 && k<K) {
					pq[k+1].push({ce+T/2,y0});
				}
			}
		}
	}
	ld ans = INF;
	for (ll k=0;k<=K;k++) {
		ans = min(ans,tmin[H][k]);
	}
	return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 860 KB Correct.
2 Correct 16 ms 808 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1624 KB Correct.
2 Correct 25 ms 1712 KB Correct.
3 Correct 22 ms 1736 KB Correct.
4 Correct 20 ms 1628 KB Correct.
5 Correct 21 ms 1624 KB Correct.
6 Correct 22 ms 4396 KB Correct.
7 Correct 23 ms 4660 KB Correct.
8 Correct 13 ms 7256 KB Correct.
9 Correct 18 ms 1368 KB Correct.
10 Correct 19 ms 1268 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1632 KB Correct.
2 Correct 31 ms 1628 KB Correct.
3 Correct 30 ms 1624 KB Correct.
4 Correct 26 ms 1264 KB Correct.
5 Correct 25 ms 1396 KB Correct.
6 Correct 7 ms 3416 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 1752 KB Correct.
2 Correct 845 ms 1872 KB Correct.
3 Correct 898 ms 1812 KB Correct.
4 Execution timed out 3025 ms 2904 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 1664 KB Correct.
2 Correct 108 ms 1620 KB Correct.
3 Correct 44 ms 27472 KB Correct.
4 Correct 369 ms 3412 KB Correct.
5 Correct 28 ms 1372 KB Correct.
6 Correct 91 ms 1680 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 892 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -