結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | もりを |
提出日時 | 2020-11-28 00:10:18 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 11,008 bytes |
コンパイル時間 | 2,204 ms |
コンパイル使用メモリ | 219,192 KB |
実行使用メモリ | 38,944 KB |
最終ジャッジ日時 | 2024-07-26 21:18:05 |
合計ジャッジ時間 | 7,456 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | TLE | - |
testcase_03 | -- | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
ソースコード
// URL : https://yukicoder.me/problems/no/1301 #pragma region optimize // #pragma GCC optimize("Ofast") // #pragma GCC optimize("unroll-loops") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx") #pragma endregion #include <bits/stdc++.h> using namespace std; // #include <atcoder/all> #pragma region boost multiprecision // #include <boost/multiprecision/cpp_dec_float.hpp> // #include <boost/multiprecision/cpp_int.hpp> // using Bint = boost::multiprecision::cpp_int; // using Bfloat32 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<32>>; // using Bfloat1024 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>; #pragma endregion // #define int long long // #define endl '\n' #pragma region TEMPLATE // clang-format off /* TYPE */ typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<pii> vpii; typedef vector<pll> vpll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<string> vst; typedef vector<bool> vb; typedef vector<ld> vld; typedef vector<vector<int>> vvi; template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>; template<typename T> using prique_r = prique<T, greater<>>; /* CONSTANT */ #define ln '\n' const int INF = 1 << 30; const ll INFF = 1LL << 60; const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const int MOD = 1e9 + 7; const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz"; const double EPS = 1e-9; const ld PI = 3.14159265358979323846264338327950288; const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1, 0 }; const int dy[] = { 0, 1, 0, -1, -1, -1, 1, 1, 0 }; /* CONTAINER */ #define PB emplace_back #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define SORT(v) sort(ALL(v)) #define RSORT(v) sort(RALL(v)) #define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin()) #define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin()) #define GREATER(x, val) (int)(x).size() - LEQ((x), (val)) #define GEQ(x, val) (int)(x).size() - LESS((x), (val)) #define UNIQUE(v) sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end()) template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); } template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); } template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); } template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); } /* LOOP */ #define _overload3(_1, _2, _3, name, ...) name #define _REP(i, n) REPI(i, 0, n) #define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i) #define REP(...) _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__) #define _RREP(i, n) RREPI(i, n, 0) #define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i) #define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__) #define EACH(e, v) for (auto& e : v) #define PERM(v) sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v))) /* INPUT */ template<typename T> void SSS(T& t) { cin >> t; } template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); } #define SS(T, ...) T __VA_ARGS__; SSS(__VA_ARGS__); #define SV(T, v, n) vector<T> v(n); for (auto& i : v) cin >> i; #define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i; /* OUTPUT */ // Yes / No inline int YES(bool x) { cout << (x ? "YES" : "NO") << endl; return 0; } inline int Yes(bool x) { cout << (x ? "Yes" : "No") << endl; return 0; } inline int yes(bool x) { cout << (x ? "yes" : "no") << endl; return 0; } inline int yES(bool x) { cout << (x ? "yES" : "nO") << endl; return 0; } inline int Yay(bool x) { cout << (x ? "Yay!" : ":(") << endl; return 0; } // PROTOTYPE DECLARATION template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j); template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t); template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c); template<typename T> ostream &operator<<(ostream &os, const stack<T> &j); template<typename T> ostream &operator<<(ostream &os, const queue<T> &j); template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j); // IMPLEMENTATION template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; } template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {} template<size_t num = 0, typename... T> enable_if_t<num < sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num + 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); } template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; } template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C &c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; } template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; } template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front()); return os << d; } template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; } // OUTPUT FUNCTION template<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1]; return 0; } inline int print() { cout << endl; return 0; } template<typename Head> int print(Head&& head){ cout << head; return print(); } template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); } #ifdef LOCAL inline void dump() { cerr << endl; } template<typename Head> void dump(Head&& head) { cerr << head; dump(); } template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); } #define debug(...) do {cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false) #else #define dump(...) #define debug(...) #endif /* OTHER */ #define fi first #define se second #define MP make_pair #define MT make_tuple template<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); } template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; } template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; } inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1) r *= a; a *= a; } while (b >>= 1); return r; } struct abracadabra { abracadabra() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(5); }; } ABRACADABRA; // clang-format on #pragma endregion #pragma region graph minimum cost flow primaldual /** * @brief Primal Dual * @docs docs/graph/minimumcostflow/primaldual.md * @see http://www.prefield.com/algorithm/graph/primal_dual.html * @note O(FE\log V) */ template <typename Cst, typename Cap> struct PrimalDual { struct CapEdge { int to, rev; Cst cst; Cap cap; CapEdge() {} CapEdge(int t, int r, Cst cst, Cap cap) : to(t), rev(r), cst(cst), cap(cap) {} operator int() const { return to; } }; using P = pair<Cst, int>; const Cst INF; int V; vector<vector<CapEdge>> graph; vector<Cst> pot, min_cst; vector<int> prv_v, prv_e; PrimalDual(int V) : INF(numeric_limits<Cst>::max()), V(V), graph(V) {} void add_arc(int a, int b, Cst cst, Cap cap) { graph[a].emplace_back(b, (int)graph[b].size(), cst, cap); graph[b].emplace_back(a, (int)graph[a].size() - 1, -cst, 0); } Cst min_cost_flow(int s, int t, Cap flw) { pot.assign(V, 0); prv_e.assign(V, -1); prv_v.assign(V, -1); Cst ret = 0; priority_queue<P, vector<P>, greater<P>> pq; while (flw > 0) { min_cst.assign(V, INF); pq.push(P(0, s)); min_cst[s] = 0; while (not pq.empty()) { Cst cst; int idx; tie(cst, idx) = pq.top(); pq.pop(); if (min_cst[idx] < cst) continue; for (int i = 0; i < (int)graph[idx].size(); ++i) { CapEdge &nxt = graph[idx][i]; int nxt_cst = min_cst[idx] + nxt.cst + pot[idx] - pot[nxt]; if (nxt.cap > 0 and min_cst[nxt] > nxt_cst) { min_cst[nxt] = nxt_cst; prv_v[nxt] = idx, prv_e[nxt] = i; pq.push(P(min_cst[nxt], nxt)); } } } if (min_cst[t] == INF) return -1; for (int v = 0; v < V; ++v) pot[v] += min_cst[v]; Cap add_flw = flw; for (int v = t; v != s; v = prv_v[v]) { add_flw = min(add_flw, graph[prv_v[v]][prv_e[v]].cap); } flw -= add_flw; ret += add_flw * pot[t]; for (int v = t; v != s; v = prv_v[v]) { CapEdge &e = graph[prv_v[v]][prv_e[v]]; e.cap -= add_flw; graph[v][e.rev].cap += add_flw; } } return ret; } }; #pragma endregion int solve(); signed main() { // int _T; cin >> _T; for (int t = 1; t <= _T; ++t) solve(); } int solve() { SS(int, N, M); PrimalDual<ll, ll> pd(N); REP (i, M) { SS(int, U, V, C, D); --U, --V; pd.add_arc(U, V, C, 1); pd.add_arc(U, V, D, 1); swap(U, V); pd.add_arc(U, V, C, 1); pd.add_arc(U, V, D, 1); } print(pd.min_cost_flow(0, N - 1, 2)); return 0; }