제출 #926714

#제출 시각아이디문제언어결과실행 시간메모리
926714Wansur사이버랜드 (APIO23_cyberland)C++17
0 / 100
91 ms128916 KiB
#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'
 
using namespace std;
typedef long long ll;
const int mx=1e5+12;
 
vector<pair<int,int>> g[mx];
double d[mx][101];
bool was[mx][101];
bool used[mx];
 
struct node{
	int v,x;
	double w;
	friend bool operator <(node a,node b){
        return a.w > b.w;
    }
};
 
void dfs(int v){
	used[v]=1;
	for(auto to:g[v]){
		if(!used[to.f]){
			dfs(to.f);
		}
	}
}
 
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){
	k=min(k,70);
	for(int i=0;i<n;i++){
		g[i].clear();
		used[i]=0;
	}
	for(int i=0;i<m;i++){
		g[x[i]].push_back({y[i],c[i]});
		g[y[i]].push_back({x[i],c[i]});
	}
	dfs(0);
	if(!used[h]){
		return -1;
	}
	for(int i=0;i<n;i++){
		for(int x=0;x<=k;x++){
			d[i][x]=2e14;
			was[i][x]=0;
		}
		used[i]=0;
	}
	used[h]=1;
	dfs(0);
	priority_queue<node> s;
	d[0][0]=0;
	s.push({0,0,0});
	for(int i=0;i<n;i++){
		if(used[i] && arr[i]==0){
			d[i][0]=0;
			s.push({i,0,0});
		}
	}
	while(s.size()){
		int v=s.top().v,x=s.top().x;
		s.pop();
		if(v==h)continue;
		if(was[v][x])continue;
		was[v][x]=1;
		for(auto To:g[v]){
			int to=To.f, w=To.s;
			if(d[to][x]>d[v][x]+w){
				d[to][x]=d[v][x]+w;
				s.push({d[to][x],to,x});
			}
			if(x<k && d[to][x+1]>d[v][x]/(long double)2.0+w && arr[v]==2){
				d[to][x+1]=d[v][x]/(long double)2.0+w;
				s.push({d[to][x+1],to,x+1});
			}
		}
	}
	double ans=2e14;
	for(int x=k;x>=0;x--){
		if(d[h][x]>=2e14)continue;
		ans=min(ans,d[h][x]);
		if(arr[h]==2 && x>0 && d[h][x-1]<2e14)ans=min(ans,d[h][x-1]/(double)2.0);
	}
	return ans;
}

컴파일 시 표준 에러 (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:74:20: warning: narrowing conversion of 'd[to][x]' from 'double' to 'int' [-Wnarrowing]
   74 |     s.push({d[to][x],to,x});
      |             ~~~~~~~^
cyberland.cpp:74:25: warning: narrowing conversion of 'x' from 'int' to 'double' [-Wnarrowing]
   74 |     s.push({d[to][x],to,x});
      |                         ^
cyberland.cpp:78:22: warning: narrowing conversion of 'd[to][(x + 1)]' from 'double' to 'int' [-Wnarrowing]
   78 |     s.push({d[to][x+1],to,x+1});
      |             ~~~~~~~~~^
cyberland.cpp:78:28: warning: narrowing conversion of '(x + 1)' from 'int' to 'double' [-Wnarrowing]
   78 |     s.push({d[to][x+1],to,x+1});
      |                           ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...