結果

問題 No.1995 CHIKA Road
ユーザー stoqstoq
提出日時 2022-07-01 21:42:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 290 ms / 2,000 ms
コード長 6,508 bytes
コンパイル時間 4,332 ms
コンパイル使用メモリ 289,344 KB
実行使用メモリ 34,596 KB
最終ジャッジ日時 2024-05-04 16:01:25
合計ジャッジ時間 8,768 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
6,812 KB
testcase_01 AC 8 ms
6,940 KB
testcase_02 AC 9 ms
6,940 KB
testcase_03 AC 9 ms
6,940 KB
testcase_04 AC 9 ms
6,944 KB
testcase_05 AC 8 ms
6,940 KB
testcase_06 AC 18 ms
8,448 KB
testcase_07 AC 50 ms
12,544 KB
testcase_08 AC 9 ms
6,940 KB
testcase_09 AC 9 ms
6,940 KB
testcase_10 AC 64 ms
12,352 KB
testcase_11 AC 290 ms
34,596 KB
testcase_12 AC 132 ms
21,376 KB
testcase_13 AC 77 ms
16,224 KB
testcase_14 AC 79 ms
16,664 KB
testcase_15 AC 237 ms
31,300 KB
testcase_16 AC 27 ms
9,600 KB
testcase_17 AC 101 ms
17,928 KB
testcase_18 AC 183 ms
24,800 KB
testcase_19 AC 186 ms
24,836 KB
testcase_20 AC 94 ms
16,880 KB
testcase_21 AC 82 ms
16,256 KB
testcase_22 AC 168 ms
24,020 KB
testcase_23 AC 54 ms
12,288 KB
testcase_24 AC 146 ms
21,820 KB
testcase_25 AC 32 ms
9,984 KB
testcase_26 AC 58 ms
13,696 KB
testcase_27 AC 138 ms
21,552 KB
testcase_28 AC 85 ms
15,872 KB
testcase_29 AC 172 ms
24,252 KB
testcase_30 AC 30 ms
9,984 KB
testcase_31 AC 18 ms
8,320 KB
testcase_32 AC 38 ms
10,880 KB
testcase_33 AC 135 ms
21,300 KB
testcase_34 AC 19 ms
8,576 KB
testcase_35 AC 56 ms
12,928 KB
testcase_36 AC 62 ms
14,080 KB
testcase_37 AC 158 ms
22,956 KB
testcase_38 AC 108 ms
19,108 KB
testcase_39 AC 21 ms
8,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

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

#include <atcoder/all>
//#include <atcoder/lazysegtree>
//#include <atcoder/modint>
//#include <atcoder/segtree>

using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#pragma region Macros

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll floor(ll a, ll b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(300010);

#pragma endregion

// -------------------------------

template <typename T>
struct dijkstra {
  int V;
  T INF;
  struct edge {
    int to;
    T cost;
  };
  vector<vector<edge>> E;
  vector<T> d;
  using pt = pair<T, int>;
  dijkstra() {}
  dijkstra(int V_) : V(V_) {
    E.resize(V);
    d.resize(V);
    if (is_same<int, T>::value)
      INF = 2e9;
    else
      INF = 8e18;
  }

  void add_edge(int a, int b, T c = 1, bool directed = true) {
    E[a].emplace_back(edge{b, c});
    if (!directed) E[b].emplace_back(edge{a, c});
  }

  void calc(int s) {
    priority_queue<pt, vector<pt>, greater<pt>> que;
    fill(d.begin(), d.end(), INF);
    que.emplace(T(0), s);
    d[s] = 0;
    while (!que.empty()) {
      pt p = que.top();
      que.pop();
      int v = p.second;
      if (d[v] < p.first) continue;
      for (auto &&e : E[v]) {
        if (d[e.to] > d[v] + e.cost) {
          d[e.to] = d[v] + e.cost;
          que.emplace(d[e.to], e.to);
        }
      }
    }
  }
};

void solve() {
  int n, m;
  cin >> n >> m;
  vector<int> a(m), b(m);
  rep(i, m) cin >> a[i] >> b[i];
  map<int, int> mp;
  rep(i, m) mp[a[i]] = mp[b[i]] = 0;
  mp[1] = 0;
  mp[n] = 0;
  int z = 0;
  for (auto &&[k, v] : mp) v = z++;

  vector<int> V;
  for (auto [k, v] : mp) V.push_back(k);
  dijkstra<ll> ds(V.size());
  rep(i, V.size() - 1) { ds.add_edge(i, i + 1, (V[i + 1] - V[i]) * 2); }
  rep(i, m) { ds.add_edge(mp[a[i]], mp[b[i]], b[i] * 2 - a[i] * 2 - 1); }
  ds.calc(mp[1]);
  cout << ds.d[mp[n]] << "\n";
}

int main() { solve(); }
0