제출 #1179179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1179179		JelalTkm	사이버랜드 (APIO23_cyberland)	C++20	0 / 100	3095 ms	5696 KiB

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

// #define int long long int

// const int N = 2e5 + 10;
// const int md = 1e9 + 7;
// const int INF = 1e18;

double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> w, vector<int> a) {
  vector<vector<pair<int, int>>> g(n + 1, vector<pair<int, int>> ());
  for (int i = 0; i < m; i++) {
    g[x[i]].push_back({y[i], w[i]});
    g[y[i]].push_back({x[i], w[i]});
  }

  vector<double> dist(g.size() + 10, -1);
  vector<bool> visited(g.size() + 10);
  set<pair<double, int>> q;
  dist[0] = 0;
  q.insert({0, 0});

  while (!q.empty()) {
    int v = (*q.begin()).second;
    if ((*q.begin()).first != dist[v])
      continue;
    q.erase(q.begin());
    for (auto i : g[v]) {
      int sm = (a[v] == 1 ? 0 : i.second);
      if (dist[i.first] == -1)
        dist[i.first] = dist[v] + (i.second - sm);
      else dist[i.first] = min(dist[i.first], dist[v] + (double)(i.second - sm));
      q.insert({dist[i.first], i.first});
    }
  }

  return dist[h];
}

// int32_t main(int32_t argc, char *argv[]) {
//   ios::sync_with_stdio(false);
//   cin.tie(nullptr);

//   int T = 1;
//   // cin >> T;
//   while (T--) {
    
//   }

//   return 0;
// }

• 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