#677126 (C++17) No.1601 With Animals into Institute

提出ソース

結果

問題	No.1601 With Animals into Institute
ユーザー	opt
提出日時	2021-07-10 14:42:13
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	405 ms / 3,000 ms
コード長	5,836 bytes
コンパイル時間	5,236 ms
コンパイル使用メモリ	273,648 KB
実行使用メモリ	31,160 KB
最終ジャッジ日時	2024-07-02 02:26:33
合計ジャッジ時間	11,852 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	5 ms 6,940 KB
testcase_04	AC	5 ms 6,944 KB
testcase_05	AC	5 ms 6,940 KB
testcase_06	AC	373 ms 31,024 KB
testcase_07	AC	390 ms 30,984 KB
testcase_08	AC	385 ms 31,000 KB
testcase_09	AC	390 ms 31,040 KB
testcase_10	AC	403 ms 31,008 KB
testcase_11	AC	393 ms 31,004 KB
testcase_12	AC	398 ms 31,004 KB
testcase_13	AC	405 ms 31,160 KB
testcase_14	AC	389 ms 30,988 KB
testcase_15	AC	395 ms 31,000 KB
testcase_16	AC	389 ms 31,148 KB
testcase_17	AC	386 ms 30,972 KB
testcase_18	AC	6 ms 6,940 KB
testcase_19	AC	6 ms 6,944 KB
testcase_20	AC	6 ms 6,940 KB
testcase_21	AC	6 ms 6,940 KB
testcase_22	AC	6 ms 6,944 KB
testcase_23	AC	5 ms 6,944 KB
testcase_24	AC	5 ms 6,944 KB
testcase_25	AC	5 ms 6,940 KB
testcase_26	AC	6 ms 6,944 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,944 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	2 ms 6,940 KB
testcase_34	AC	2 ms 6,940 KB
testcase_35	AC	2 ms 6,940 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	2 ms 6,944 KB
testcase_38	AC	2 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
// input and output of modint
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }
template<int m> istream &operator>>(istream &is, static_modint<m> &a) { long long v; is >> v; a = v; return is; }
template<int m> ostream &operator<<(ostream &os, const static_modint<m> &a) { return os << a.val(); }
template<int m> istream &operator>>(istream &is, dynamic_modint<m> &a) { long long v; is >> v; a = v; return is; }
template<int m> ostream &operator<<(ostream &os, const dynamic_modint<m> &a) { return os << a.val(); }
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), lim##i = (b); i < lim##i; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define drep_(i, a_, b_, a, b, ...) for (int i = (a)-1, lim##i = (b); i >= lim##i; --i)
#define drep(i, ...) drep_(i, __VA_ARGS__, __VA_ARGS__, __VA_ARGS__, 0)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <class Head, class... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
using ll = long long;
using ld = long double;
using Vi = V<int>;  using VVi = VV<int>;
using Vl = V<ll>;   using VVl = VV<ll>;
using Vd = V<ld>;   using VVd = VV<ld>;
using Vb = V<bool>; using VVb = VV<bool>;
template<class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
template<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class T> inline int sz(const T &x) { return x.size(); }
template<class T> inline bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<class T, size_t n> istream &operator>>(istream &is, array<T, n> &v) { for (auto &e : v) is >> e; return is; }
template<class T, size_t n> ostream &operator<<(ostream &os, const  array<T, n> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> istream &operator>>(istream &is, deque<T> &v) { for (auto &e : v) is >> e; return is; }
template<class T> ostream &operator<<(ostream &os, const deque<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> inline void deduplicate(vector<T> &a) { sort(all(a)); a.erase(unique(all(a)), a.end()); }
template<class T> inline int count_between(const vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline ll ceil_div(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)
inline int floor_log2(const ll x) { assert(x > 0); return 63 - __builtin_clzll(x); } // floor(log2(x))
inline int ceil_log2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64 - __builtin_clzll(x-1); } // ceil(log2(x))
inline int popcount(const ll x) { return __builtin_popcountll(x); }
inline void fail() { cout << -1 << '\n'; exit(0); }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
// constexpr int INF = numeric_limits<int>::max() >> 1;
// constexpr ll INFll = numeric_limits<ll>::max() >> 1;
// constexpr ld EPS = 1e-10;
// const ld PI = acos(-1.0);
// using mint = modint998244353;
// using mint = modint1000000007;
// using mint = modint;
// using Vm = V<mint>; using VVm = V<Vm>;


template<class T>
struct edge {
  int v; T w;
  edge(int v, T w) : v(v), w(w) {}
};
template<class T>
using Graph = vector<vector<edge<T>>>;

template<class T>
vector<T> dijkstra(const Graph<T> &G, int s) {
  int n = G.size();
  const auto INF_T = numeric_limits<T>::max() / 2 - 1;
  vector<T> dist(n, INF_T);
  using PTi = pair<T, int>;
  priority_queue<PTi, vector<PTi>, function<bool(PTi, PTi)>> pq(
    [] (auto x, auto y) { return x.first > y.first; }
  );

  dist[s] = 0;
  pq.emplace(dist[s], s);
  
  while (!pq.empty()) {
    auto [d, u] = pq.top(); pq.pop();
    if (dist[u] < d) continue;
    for (auto &[v, w] : G[u]) if (chmin(dist[v], d + w)) pq.emplace(dist[v], v);
  }
  return dist;
}


void solve() {
  int n, m; cin >> n >> m;
  Graph<ll> G(2*n);
  rep(_, m) {
    int u, v, w, x; cin >> u >> v >> w >> x;
    --u, --v;
    G[u].emplace_back(v, w);
    G[v].emplace_back(u, w);
    G[u+n].emplace_back(v+n, w);
    G[v+n].emplace_back(u+n, w);
    if (x) {
      G[u].emplace_back(v+n, w);
      G[v].emplace_back(u+n, w);
    }
  }
  
  auto dist = dijkstra(G, n-1);
  rep(i, n-1) cout << dist[n+i] << '\n';
}


int main() {
  solve();
  // cout << solve() << '\n';
}

yukicoder

結果

テストケース

ソースコード