제출 #917535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917535		shenfe1	사이버랜드 (APIO23_cyberland)	C++17	68 / 100	3099 ms	30516 KiB

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
// #define int ll

const int MAX=1e5+15;
const ld inf=1e18;

vector<pii> g[MAX];
double dp[MAX][32];

double solve(int n,int m,int k,int h,vector<int> x,vector<int> y,vector<int> c,vector<int> arr){
  for(int i=0;i<=n;i++)g[i].clear();
  for(int i=0;i<m;i++){
    x[i]++;
    y[i]++;
    g[x[i]].pb({y[i],c[i]});
    g[y[i]].pb({x[i],c[i]});
    // cout<<x[i]<<" "<<y[i]<<" "<<c[i]<<"\n";
  }
  h++;
  for(int i=1;i<=n;i++){
    for(int j=0;j<=k;j++)dp[i][j]=inf;
  }
  dp[1][0]=0;
  priority_queue<pair<ld,pii>> q;
  q.push({0,{1,0}});
  while(!q.empty()){
    pair<ld,pii> boofer=q.top();
    q.pop();
    int v=boofer.S.F,c=boofer.S.S;
    if(dp[v][c]<boofer.F||v==h)continue;
    // cout<<v<<" "<<c<<" "<<dp[v][c]<<"\n";
    for(auto to:g[v]){
      if(arr[to.F-1]==0){
        if(dp[to.F][c]>0){
          dp[to.F][c]=0;
          q.push({dp[to.F][c],{to.F,c}});
        }
      }
      else if(arr[to.F-1]==1){
        if(dp[v][c]+to.S<dp[to.F][c]){
          dp[to.F][c]=dp[v][c]+to.S;
          q.push({dp[to.F][c],{to.F,c}});
        }
      }
      else{
        if(dp[v][c]+to.S<dp[to.F][c]){
          dp[to.F][c]=dp[v][c]+to.S;
          q.push({dp[to.F][c],{to.F,c}});
        }
        ld cost=(dp[v][c]+to.S)/2;
        if(c+1<=k&&cost<dp[to.F][c+1]){
          dp[to.F][c+1]=cost;
          q.push({dp[to.F][c+1],{to.F,c+1}});
        }
      }
    }
  }
  double ans=inf;
  for(int i=0;i<=k;i++)ans=min(ans,dp[h][i]);
  if(ans==inf)return -1.0;
  return ans;
}

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