提出 #67562722

---

ソースコード 拡げる

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>

//#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define pb push_back
#define eb emplace_back
#define clock chrono::steady_clock::now().time_since_epoch().count()

using namespace std;

template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(size_t i = 0; T x : arr) {
    os << x;
    if (++i != N) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(size_t i = 0; T x : vec) {
    os << x;
    if (++i != size(vec)) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(size_t i = 0; T x : s) {
    os << x;
    if (++i != size(s)) os << ' ';
  }
  return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2> &m) {
  for(size_t i = 0; pair<T1, T2> x : m) {
    os << x;
    if (++i != size(m)) os << ' ';
  }
  return os;
}

#ifdef DEBUG
#define dbg(...) cerr << '(', _do(#__VA_ARGS__), cerr << ") = ", _do2(__VA_ARGS__)
template<typename T> void _do(T &&x) { cerr << x; }
template<typename T, typename ...S> void _do(T &&x, S&&...y) { cerr << x << ", "; _do(y...); }
template<typename T> void _do2(T &&x) { cerr << x << endl; }
template<typename T, typename ...S> void _do2(T &&x, S&&...y) { cerr << x << ", "; _do2(y...); }
#else
#define dbg(...)
#endif

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
//#define double ldb

template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_heap = priority_queue<T>;

template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP = plus<T>>
void pSum(rng &&v) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = OP()(p, x);
}
template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP>
void pSum(rng &&v, OP op) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = op(p, x);
}

template<ranges::forward_range rng>
void Unique(rng &v) {
  ranges::sort(v);
  v.resize(unique(v.begin(), v.end()) - v.begin());
}

template<ranges::random_access_range rng>
rng invPerm(rng p) {
  rng ret = p;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = i;
  return ret;
}

template<ranges::random_access_range rng, ranges::random_access_range rng2>
rng Permute(rng v, rng2 p) {
  rng ret = v;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = v[i];
  return ret;
}

template<bool directed>
vector<vector<int>> readGraph(int n, int m, int base) {
  vector<vector<int>> g(n);
  for(int i = 0; i < m; i++) {
    int u, v; cin >> u >> v;
    u -= base, v -= base;
    g[u].emplace_back(v);
    if constexpr (!directed)
      g[v].emplace_back(u);
  }
  return g;
}

template<class T>
void setBit(T &msk, int bit, bool x) {
  msk = (msk & ~(T(1) << bit)) | (T(x) << bit);
}
template<class T> void flipBit(T &msk, int bit) { msk ^= T(1) << bit; }
template<class T> bool getBit(T msk, int bit) { return msk >> bit & T(1); }

template<class T>
T floorDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? a / b : (a - b + 1) / b;
}
template<class T>
T ceilDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? (a + b - 1) / b : a / b;
}

template<class T> bool chmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template<class T> bool chmax(T &a, T b) { return a < b ? a = b, 1 : 0; }

template<class T>
pair<vector<T>, vector<int>> Dijkstra(vector<vector<pair<int, T>>> &g, int s) {
  int n = ssize(g);
  vector<T> dis(n, -1);
  vector<int> pre(n, -1);
  priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;

  dis[s] = 0;
  pq.push({0, s});

  while(!pq.empty()) {
    auto [d, v] = pq.top(); pq.pop();
    if (dis[v] != d) continue;
    for(auto [x, w] : g[v]) {
      if (dis[x] != -1 and d + w >= dis[x]) continue;
      dis[x] = d + w, pre[x] = v;
      pq.push(make_pair(d + w, x));
    }
  }

  return make_pair(dis, pre);
}

vector<int> recover(vector<int> &pre, int t) {
  if (pre[t] == -1) return {};
  vector<int> path(1, t);
  while(pre[t] != -1)
    path.emplace_back(t = pre[t]);
  ranges::reverse(path);
  return path;
}

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, m; cin >> n >> m;
  vector<ll> x(n);
  for(ll &y : x) cin >> y;
  vector<array<ll, 5>> lrLRc(m);
  for(auto &a : lrLRc) {
    for(ll &y : a)
      cin >> y;
    a[0]--, a[2]--;
  }

  auto query = [&](int l, int r, int base) {
    vector<int> id;
    for(l += n, r += n; l < r; l >>= 1, r >>= 1) {
      if (l & 1) id.eb(l < n ? l + base : l - n), l++;
      if (r & 1) r--, id.eb(r < n ? r + base : r - n);
    }
    return id;
  };

  vector<vector<pair<int, ll>>> g(5 * n + m);
  for(int b = n + m, f = 0; b < ssize(g); b += n, f++) {
    for(int i = 1; (i << 1) < n; i++) {
      if (f < 2) g[(i << 1) + b].eb(i + b, 0), g[(i << 1 | 1) + b].eb(i + b, 0);
      else g[i + b].eb((i << 1) + b, 0), g[i + b].eb((i << 1 | 1) + b, 0);
    }
  }

  auto id = [&](bool D, bool R) {
    return n + m + (D ? 2 * n : 0ll) + (R ? n : 0ll);
  };

  for(int me = n - 1; auto [l, r, L, R, c] : lrLRc) {
    me++;
    if (l < L) { //R
      for(int v : query(l, r, id(false, true)))
        g[v].eb(me, v < n ? -x[v] : 0ll);
      for(int v : query(L, R, id(true, true)))
        g[me].eb(v, v < n ? x[v] + c : c);
    } else { //L
      for(int v : query(l, r, id(false, false)))
        g[v].eb(me, v < n ? x[v] : 0ll);
      for(int v : query(L, R, id(true, false)))
        g[me].eb(v, v < n ? -x[v] + c : c);
    }
  }

  for(int v = 0; v < n; v++) {
    g[v].eb(id(false, true) + ((n + v) >> 1), -x[v]);
    g[v].eb(id(false, false) + ((n + v) >> 1), x[v]);
    g[id(true, true) + ((n + v) >> 1)].eb(v, x[v]);
    g[id(true, false) + ((n + v) >> 1)].eb(v, -x[v]);
  }

  dbg("A");
  auto dis = Dijkstra(g, 0).first;

  dis.resize(n);
  dis.erase(dis.begin());
  cout << dis << '\n';

  return 0;
}

提出情報

ジャッジ結果