Submission #981884

#	Time	Username	Problem	Language	Result	Execution time	Memory
981884		vjudge1	Cyberland (APIO23_cyberland)	C++17	15 / 100	439 ms	22372 KiB

cyberland

#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define pll pair<ll, ll>
#define fi first
#define se second
#define state array<double, 3>
#define pb push_back
#define ll long long

using namespace std;

const double inf=1e18;

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){
	if(K>30) return -1;
	vector<pll> adj[N];
	rep(i,0,M){
		adj[x[i]].pb({y[i],c[i]});
		adj[y[i]].pb({x[i],c[i]});
	}
	double dis[N][35]{};
	rep(i,0,N) rep(j,0,K+1) dis[i][j]=inf;
	priority_queue<state, vector<state>, greater<state>> pq;
	pq.push({0,0,0});
	dis[0][0]=0;
	while(pq.size()){
		int u=pq.top()[1], k=pq.top()[2];
		double w=pq.top()[0];
		pq.pop();
		if(dis[u][k]<w) continue;
		repa(v,adj[u]){
			if(dis[v.fi][k]>dis[u][k]+v.se){
				dis[v.fi][k]=dis[u][k]+v.se;
				pq.push({dis[v.fi][k],v.fi,k});
			}else if(k<K && arr[v.fi]==2 && dis[v.fi][k+1]>(dis[u][k]+v.se)/2){
				dis[v.fi][k+1]=(dis[u][k]+v.se)/2;
				pq.push({dis[v.fi][k],v.fi,k+1});
			}else if(!arr[v.fi] && dis[v.fi][k]){
				dis[v.fi][k]=0;
				pq.push({dis[v.fi][k],v.fi,k});
			}
		}
	}
	double ans=inf;
	rep(i,0,K) ans=min(ans,dis[H][i]);
	if(ans==inf) return -1;
	else return ans;
}

Compilation message (stderr)

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:5:12: warning: narrowing conversion of 'v.std::pair<long long int, long long int>::first' from 'long long int' to 'double' [-Wnarrowing]
    5 | #define fi first
      |            ^
cyberland.cpp:35:29: note: in expansion of macro 'fi'
   35 |     pq.push({dis[v.fi][k],v.fi,k});
      |                             ^~
cyberland.cpp:35:32: warning: narrowing conversion of 'k' from 'int' to 'double' [-Wnarrowing]
   35 |     pq.push({dis[v.fi][k],v.fi,k});
      |                                ^
cyberland.cpp:5:12: warning: narrowing conversion of 'v.std::pair<long long int, long long int>::first' from 'long long int' to 'double' [-Wnarrowing]
    5 | #define fi first
      |            ^
cyberland.cpp:38:29: note: in expansion of macro 'fi'
   38 |     pq.push({dis[v.fi][k],v.fi,k+1});
      |                             ^~
cyberland.cpp:38:33: warning: narrowing conversion of '(k + 1)' from 'int' to 'double' [-Wnarrowing]
   38 |     pq.push({dis[v.fi][k],v.fi,k+1});
      |                                ~^~
cyberland.cpp:5:12: warning: narrowing conversion of 'v.std::pair<long long int, long long int>::first' from 'long long int' to 'double' [-Wnarrowing]
    5 | #define fi first
      |            ^
cyberland.cpp:41:29: note: in expansion of macro 'fi'
   41 |     pq.push({dis[v.fi][k],v.fi,k});
      |                             ^~
cyberland.cpp:41:32: warning: narrowing conversion of 'k' from 'int' to 'double' [-Wnarrowing]
   41 |     pq.push({dis[v.fi][k],v.fi,k});
      |                                ^

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