Submission #1069699

#	Time	Username	Problem	Language	Result	Execution time	Memory
1069699		Halym2007	Cyberland (APIO23_cyberland)	C++17	0 / 100	75 ms	120656 KiB

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <ll, ll>
const int N = 2e5 + 5;
const int git = 35;
vector <pii> v[N];
double dis[git][N];
set <pii> q[N];
ll n, m, k, h, vis[N];
vector <ll> a, tt;
double jogap = 1e16;


void dfs (ll x) {
	vis[x] = 1;
	for (pii i : v[x]) {
		if (vis[i.ff]) continue;
		dfs(i.ff);
	}
}


double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
	n = N;m = M;k = K;h = H;
	a.resize(n);
	for (int i = 0; i < n; ++i) {
		a[i] = arr[i];
	}
	for (int i = 0; i < m; ++i) {
		v[x[i]].pb ({y[i], c[i]});
		v[y[i]].pb ({x[i], c[i]});
	}
	jogap = 1e16;
	dfs (0);
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < git; ++j) {
			dis[j][i] = 1e16;
		}
	}
	q[0].insert ({0, 0});
	dis[0][0] = 0;
	for (int i = 0; i < n; ++i) {
		if (!a[i] and vis[i]) {
			q[0].insert ({0, i});
			dis[0][i] = 0;
		}
	}
	for (int i = 0; i <= k; ++i) {
		while (!q[i].empty()) {
			pii x = *q[i].begin();
			q[i].erase(q[i].begin());
			for (pii j : v[x.ss]) {
				double val = dis[i][x.ss] + j.ss;
				if (a[j.ff] == 2) {
					val /= 2;
					if (dis[i + 1][j.ff] > val) {
						dis[i + 1][j.ff] =  val;
						q[i + 1].insert ({val, j.ff});
					}
				}
				else if (val < dis[i][j.ff]) {
					dis[i][j.ff] = val;
					q[i].insert ({val, dis[i][j.ff]});
				}
			} 
		}
		jogap = min (jogap, dis[i][h]);
	}
	
	if (jogap == (double)1e16) jogap = -1;
	for (int i = 0; i < n; ++i) {
		v[i].clear();
		vis[i] = 0;
	}
	for (int i = 0; i < git; ++i) {
		q[i].clear();
	}
	return jogap;
}
 
 
//int main() {
//	freopen ("input.txt", "r", stdin);
//  int T;
//  assert(1 == scanf("%d", &T));
//  while (T--){
//    int N,M,K,H;
//    assert(4 == scanf("%d %d %d\n%d", &N, &M, &K, &H));
//    std::vector<int> x(M);
//    std::vector<int> y(M);
//    std::vector<int> c(M);
//    std::vector<int> arr(N);
//    for (int i=0;i<N;i++)
//      assert(1 == scanf("%d", &arr[i]));
//    for (int i=0;i<M;i++)
//      assert(3 == scanf("%d %d %d", &x[i], &y[i], &c[i]));
//    printf("%.12lf\n", solve(N, M, K, H, x, y, c, arr));
//  }
//}
 
 
/*
1
3 2 30 2
1 2 1
1 2 12
2 0 4
answer : 4.00000000000
 
1
4 4 30
3
1 0 2 1
0 1 5
0 2 4
1 3 2
2 3 4
answer : 2.00000000000
*/

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