제출 #1237119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237119		thewizardman	Robot (JOI21_ho_t4)	C++20	0 / 100	3097 ms	58564 KiB

Main

#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define plpll pair<ll, pll>
#define pipii pair<int, pii>
#define plpii pair<ll, pii>
#define pipll pair<int, pll>
#define lll tuple<ll, ll, ll>
#define iii tuple<int, int, int>
#define lii tuple<ll, int, int>
#define lli tuple<ll, ll, int>
#define md 1000000007LL
#define linf 0x3f3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define lninf (ll)0xc0c0c0c0c0c0c0c0
#define ninf (int)0xc0c0c0c0
#define bruh ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ss << ' ' <<
#ifdef wizard
  #define usaco(x)
#else
  #define usaco(x) ifstream cin(#x ".in"); ofstream cout(#x ".out");
#endif

template<class T1, class T2>
istream& operator>>(istream& in, pair<T1, T2>& p) {
  return in >> p.first >> p.second;
}

template<class T1, class T2>
ostream& operator<<(ostream& out, const pair<T1, T2>& p) {
  return out << p.first << ' ' << p.second;
}

template<size_t I = 0, typename... Ts>
typename enable_if<I == sizeof...(Ts), istream&>::type
read_tuple(istream& in, tuple<Ts...>& t) { return in; }

template<size_t I = 0, typename... Ts>
typename enable_if<I < sizeof...(Ts), istream&>::type
read_tuple(istream& in, tuple<Ts...>& t) {
  in >> get<I>(t);
  return read_tuple<I + 1>(in, t);
}

template<typename... Ts>
istream& operator>>(istream& in, tuple<Ts...>& t) {
  return read_tuple(in, t);
}

template<size_t I = 0, typename... Ts>
typename enable_if<I == sizeof...(Ts), void>::type
write_tuple(ostream& out, const tuple<Ts...>&) {}

template<size_t I = 0, typename... Ts>
typename enable_if<I < sizeof...(Ts), void>::type
write_tuple(ostream& out, const tuple<Ts...>& t) {
  if (I) out << ' ';
  out << get<I>(t);
  write_tuple<I + 1>(out, t);
}

template<typename... Ts>
ostream& operator<<(ostream& out, const tuple<Ts...>& t) {
  write_tuple(out, t);
  return out;
}

template<typename T>
istream& operator>>(istream& in, vector<T>& v) {
  for (auto& x : v) in >> x;
  return in;
}

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  for (size_t i = 0; i < v.size(); ++i)
    out << (i ? " " : "") << v[i];
  return out;
}

typedef array<ll, 4> l4;
ll n, m, ans = linf;
vector<lll> adj[100001];
map<int, ll> dist[100001], cost[100001];
priority_queue<l4, vector<l4>, greater<l4>> pq;

int main() {
  bruh;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    static int u, v, c, p; cin >> u >> v >> c >> p;
    adj[u].push_back({v, c, p});
    adj[v].push_back({u, c, p});
    cost[u][c] += p;
    cost[v][c] += p;
  }
  pq.push({dist[1][0] = 0, 1, 0, 0});
  while (!pq.empty()) {
    auto [d, u, c, cc] = pq.top(); pq.pop();
    if (d > dist[u][c]) continue;
    for (auto [v, col, p]: adj[u]) {
      ll dd = d + min(cost[u][col] - p - (col == c ? cc : 0), p), dd2 = d + p;
      if (!dist[v].count(0) || dd < dist[v][0]) pq.push({dist[v][0] = dd, v, 0, 0});
      if (!dist[v].count(col) || dd2 < dist[v][col]) pq.push({dist[v][col] = dd2, v, col, p});
    }
  }
  for (auto [key, val]: dist[n]) ans = min(ans, val);
  cout << (ans > 1e18 ? -1 : ans);
}

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