제출 #859882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
859882		NeroZein	Robot (JOI21_ho_t4)	C++17	0 / 100	566 ms	78292 KiB

Main

#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

using arr = array<long long, 3>;

const int N = 1e5 + 5;

map<bool, bool> vis[N]; 
map<int, long long> ps[N]; 
map<int, long long> dp[N]; 
vector<array<int, 3>> g[N]; 

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int u, v, c, w;
    cin >> u >> v >> c >> w;
    ps[v][c] += w;
    ps[u][c] += w; 
    g[u].push_back({v, w, c});
    g[v].push_back({u, w, c});
  }
  priority_queue<arr, vector<arr>, greater<arr>> pq;
  dp[1][0] = 0; 
  pq.push({0, 0, 1}); 
  while (!pq.empty()) {
    auto [cost, color, v] = pq.top();
    pq.pop();
    if (vis[v][color]) {
      continue;
    }
    bool tp = (color > 0); 
    if (v == n && !tp) {
      cout << cost << '\n';
      return 0; 
    }
    vis[v][color] = true; 
    for (auto [u, w, c] : g[v]) {
      long long pay = cost;
      if (tp) {//change all 
        if (c == color) {
          pay += ps[v][color] - w;
          if (!dp[u].count(0) || dp[u][0] > pay) {
            dp[u][0] = pay;
            pq.push({pay, 0, u}); 
          }          
        }
      } else {
        if (!dp[u].count(c) || dp[u][c] > pay) {
          dp[u][c] = pay;
          pq.push({pay, c, u}); 
        }
        pay += min((long long) w, ps[v][c] - w);
        if (!dp[u].count(0) || dp[u][0] > pay) {
          dp[u][0] = pay;
          pq.push({pay, 0, u});
        }
      }
    }
  }
  cout << -1 << '\n'; 
  return 0;
}

• Subtask 1: 0 / 34
• Subtask 2: 0 / 24
• Subtask 3: 0 / 42