oj.uz

Submission #1088956

# Submission time Handle Problem Language Result Execution time Memory
1088956 2024-09-15T16:04:53 Z Math4Life2020 Cyberland (APIO23_cyberland) C++17
61 / 100
 3000 ms 2097152 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
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];
	ld tminT[N][K+1]; //temporary
	bool dfsf[N];
	for (ll i=0;i<N;i++) {
		dfsf[i]=0;
		for (ll k=0;k<=K;k++) {
			tmin[i][k]=INF;
			tminT[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++) {
		if (k != 0) {
			for (ll i=0;i<N;i++) {
				if (tminT[i][k]!=INF) {
					pq[k].push({tminT[i][k],i});
				}
			}
		}
		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;
				if (tmin[y0][k]>=(ce+T+1e-10)) {
					pq[k].push({ce+T,y0});
				}
				if (arr[x0]==2 && k<K) {
					tminT[y0][k+1]=min(tminT[y0][k+1],ce+T/2);
				}
			}
		}
	}
	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 18 ms 856 KB Correct.
2 Correct 19 ms 856 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1564 KB Correct.
2 Correct 25 ms 1612 KB Correct.
3 Correct 24 ms 1576 KB Correct.
4 Correct 24 ms 1624 KB Correct.
5 Correct 24 ms 1624 KB Correct.
6 Correct 23 ms 6748 KB Correct.
7 Correct 32 ms 6748 KB Correct.
8 Correct 17 ms 12124 KB Correct.
9 Correct 22 ms 1116 KB Correct.
10 Correct 22 ms 1116 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1372 KB Correct.
2 Correct 31 ms 1628 KB Correct.
3 Correct 28 ms 1628 KB Correct.
4 Correct 28 ms 1228 KB Correct.
5 Correct 27 ms 1116 KB Correct.
6 Correct 11 ms 5328 KB Correct.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 37972 KB Correct.
2 Correct 120 ms 2040 KB Correct.
3 Correct 105 ms 2028 KB Correct.
4 Correct 115 ms 2032 KB Correct.
5 Correct 77 ms 1268 KB Correct.

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 1512 KB Correct.
2 Correct 370 ms 1768 KB Correct.
3 Correct 362 ms 1616 KB Correct.
4 Execution timed out 3054 ms 6660 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 1448 KB Correct.
2 Correct 69 ms 1588 KB Correct.
3 Correct 51 ms 45364 KB Correct.
4 Correct 242 ms 4948 KB Correct.
5 Correct 27 ms 1112 KB Correct.
6 Correct 71 ms 1776 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3028 ms 1712 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 963 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -