제출 #879847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
879847		emad234	사이버랜드 (APIO23_cyberland)	C++17	15 / 100	2245 ms	2097152 KiB

cyberland

#include <bits/stdc++.h>
#define all(v) ((v).begin(),(v).end())
#define F first
#define S second
typedef long long ll;
#define pii pair<ll,double>
using namespace std;
const ll mod = 1e9 + 7;
const ll mxN = 4e6 + 5;
struct path{
  ll i,k,fl;
  double val;
};
bool operator<(path a,path b){
  return a.val < b.val;
}
bool operator>(path a,path b){
  return a.val > b.val;
}
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    vector<vector<pii>>v;
    const int nsz = N + 3;
    const int ksz = K + 3;
    double dp[nsz][ksz][2];
    bool vis[nsz] = {};
    v.resize(N + 3);
    for(int i = 0;i < M;i++){
      v[x[i]].push_back({y[i],(double)c[i]});
      v[y[i]].push_back({x[i],(double)c[i]});
    }
    for(int i = 0;i < N;i++){
      for(int j = 0;j <= K;j++){
        dp[i][j][0] = (double)1e18;
        dp[i][j][1] = (double)1e18;
      }
    }
    dp[H][0][0] = 0;
    priority_queue<path,vector<path>,greater<path>>q;
    q.push({H,0,0});
    while(q.size()){
      auto u = q.top();
      vis[u.i] = 1;
      q.pop();
      if(dp[u.i][u.k][u.fl] < u.val) continue;
      for(auto x : v[u.i]){
        if((arr[u.i] == 0 && u.k < K)  || u.fl == 1){
          if(dp[x.F][u.k + (!u.fl)][1] > u.val){
            dp[x.F][u.k+ (!u.fl)][1] = u.val;
            q.push({x.F,u.k+ (!u.fl),1,dp[x.F][u.k][1]});
          }
        }
        if(arr[u.i] == 2 && u.k < K){
          if(dp[x.F][u.k + 1][0] > u.val + (x.S / (exp2(u.k + 1)))){
            dp[x.F][u.k + 1][0] = u.val + (x.S / (exp2(u.k + 1)));
            q.push({x.F,u.k + 1,u.fl,dp[x.F][u.k + 1][0]});
          }
        }
        if(dp[x.F][u.k][0] > u.val + (x.S / (exp2(u.k)))){
          dp[x.F][u.k][0] = u.val + (x.S / (exp2(u.k)));
          q.push({x.F,u.k,u.fl,dp[x.F][u.k][0]});
        }
      }
    }
    double ans = (double)1e18;
    for(int i = 0; i <= K;i++){
      ans = min(ans,dp[0][i][0]);
      ans = min(ans,dp[0][i][1]);
    }
    if(!vis[0]) return -1;
    return ans;
}

// int main() {
//   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));
//     vector<int> x(M);
//     vector<int> y(M);
//     vector<int> c(M);
//     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));
//   }
// }

• 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