제출 #982067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982067		vjudge1	Cyberland (APIO23_cyberland)	C++17	0 / 100	55 ms	7248 KiB

cyberland

// hola soy Dember :D
// 31/03/2024

#include <bits/stdc++.h>

#define ll int
#define pll pair<ll,ll>
#define F first
#define S second 
#define Z size()
#define pb push_back
#define bp pop_back
#define fo(x,y,z) for(ll x=y; x<=z; x++)
#define of(x,y,z) for(ll x=y; x>=z; x--)
#define all(n) n.begin(), n.end()
#define arr(x,y,z) x+y, x+y+z
#define dd double

using namespace std;

const dd inf=1e18;

vector<vector<pair<ll, dd>>> v;
vector<dd> dp, tt; 
dd ans=1e18;

dd solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> a) {
	k=min(k, 100);
	v.resize(n);
	fo(i,0,m-1){
		v[x[i]].pb({y[i], c[i]});
		v[y[i]].pb({x[i], c[i]});
	}
	
	dp.resize(n, 1e18);
	
	priority_queue<pair<dd, ll>> q;
    
	fo(j,0,k){
		tt.resize(n,1e18);
		if(j){
			fo(i,0,n-1){
				if(a[i]==1 || dp[i]==1e18)continue;
				if(a[i]==0)tt[i]=0;
				q.push({-dp[i]/2., i});
			}
		}
		else q.push({0., 0});
		
		while(!q.empty()) {
			auto [xd, u]=q.top(); xd=-xd;
			q.pop();
			
			if(u==h)continue;
			
			for(auto [adios, ola]:v[u]){
				if(tt[adios]>xd+ola){
					if(a[adios]==0) tt[adios]=0.;
					else tt[adios]=xd+ola;
					q.push({-tt[adios], adios});
				}
			}
			
		}
		ans=min(ans, tt[h]);
		if(j==0 && tt[h]==1e18)break;
		//swap(tt, dp);
	}
	return ((ans==1e18)? -1.: ans);
}

• 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