結果
| 問題 | No.2604 Initial Motion |
| ユーザー |
 maspy
|
| 提出日時 | 2024-01-12 21:48:12 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 20,517 bytes |
| コンパイル時間 | 5,469 ms |
| コンパイル使用メモリ | 315,156 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-09-27 21:52:02 |
| 合計ジャッジ時間 | 9,595 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 31 RE * 8 |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;using u128 = unsigned __int128;using f128 = __float128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) \for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }int popcnt_mod_2(int x) { return __builtin_parity(x); }int popcnt_mod_2(u32 x) { return __builtin_parity(x); }int popcnt_mod_2(ll x) { return __builtin_parityll(x); }int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sm = 0;for (auto &&a: A) sm += a;return sm;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) \sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;(check(x) ? ok : ng) = x;}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;(check(x) ? ok : ng) = x;}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}#endif#line 1 "/home/maspy/compro/library/other/io.hpp"#define FASTIO#include <unistd.h>// https://judge.yosupo.jp/submission/21623namespace fastio {static constexpr uint32_t SZ = 1 << 17;char ibuf[SZ];char obuf[SZ];char out[100];// pointer of ibuf, obufuint32_t pil = 0, pir = 0, por = 0;struct Pre {char num[10000][4];constexpr Pre() : num() {for (int i = 0; i < 10000; i++) {int n = i;for (int j = 3; j >= 0; j--) {num[i][j] = n % 10 | '0';n /= 10;}}}} constexpr pre;inline void load() {memcpy(ibuf, ibuf + pil, pir - pil);pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);pil = 0;if (pir < SZ) ibuf[pir++] = '\n';}inline void flush() {fwrite(obuf, 1, por, stdout);por = 0;}void rd(char &c) {do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));}void rd(string &x) {x.clear();char c;do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));do {x += c;if (pil == pir) load();c = ibuf[pil++];} while (!isspace(c));}template <typename T>void rd_real(T &x) {string s;rd(s);x = stod(s);}template <typename T>void rd_integer(T &x) {if (pil + 100 > pir) load();char c;doc = ibuf[pil++];while (c < '-');bool minus = 0;if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (c == '-') { minus = 1, c = ibuf[pil++]; }}x = 0;while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (minus) x = -x;}}void rd(int &x) { rd_integer(x); }void rd(ll &x) { rd_integer(x); }void rd(i128 &x) { rd_integer(x); }void rd(u32 &x) { rd_integer(x); }void rd(u64 &x) { rd_integer(x); }void rd(u128 &x) { rd_integer(x); }void rd(double &x) { rd_real(x); }void rd(long double &x) { rd_real(x); }void rd(f128 &x) { rd_real(x); }template <class T, class U>void rd(pair<T, U> &p) {return rd(p.first), rd(p.second);}template <size_t N = 0, typename T>void rd_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);rd(x);rd_tuple<N + 1>(t);}}template <class... T>void rd(tuple<T...> &tpl) {rd_tuple(tpl);}template <size_t N = 0, typename T>void rd(array<T, N> &x) {for (auto &d: x) rd(d);}template <class T>void rd(vc<T> &x) {for (auto &d: x) rd(d);}void read() {}template <class H, class... T>void read(H &h, T &... t) {rd(h), read(t...);}void wt(const char c) {if (por == SZ) flush();obuf[por++] = c;}void wt(const string s) {for (char c: s) wt(c);}void wt(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) wt(s[i]);}template <typename T>void wt_integer(T x) {if (por > SZ - 100) flush();if (x < 0) { obuf[por++] = '-', x = -x; }int outi;for (outi = 96; x >= 10000; outi -= 4) {memcpy(out + outi, pre.num[x % 10000], 4);x /= 10000;}if (x >= 1000) {memcpy(obuf + por, pre.num[x], 4);por += 4;} else if (x >= 100) {memcpy(obuf + por, pre.num[x] + 1, 3);por += 3;} else if (x >= 10) {int q = (x * 103) >> 10;obuf[por] = q | '0';obuf[por + 1] = (x - q * 10) | '0';por += 2;} elseobuf[por++] = x | '0';memcpy(obuf + por, out + outi + 4, 96 - outi);por += 96 - outi;}template <typename T>void wt_real(T x) {ostringstream oss;oss << fixed << setprecision(15) << double(x);string s = oss.str();wt(s);}void wt(int x) { wt_integer(x); }void wt(ll x) { wt_integer(x); }void wt(i128 x) { wt_integer(x); }void wt(u32 x) { wt_integer(x); }void wt(u64 x) { wt_integer(x); }void wt(u128 x) { wt_integer(x); }void wt(double x) { wt_real(x); }void wt(long double x) { wt_real(x); }void wt(f128 x) { wt_real(x); }template <class T, class U>void wt(const pair<T, U> val) {wt(val.first);wt(' ');wt(val.second);}template <size_t N = 0, typename T>void wt_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { wt(' '); }const auto x = std::get<N>(t);wt(x);wt_tuple<N + 1>(t);}}template <class... T>void wt(tuple<T...> tpl) {wt_tuple(tpl);}template <class T, size_t S>void wt(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}template <class T>void wt(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}void print() { wt('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {wt(head);if (sizeof...(Tail)) wt(' ');print(forward<Tail>(tail)...);}// gcc expansion. called automaticall after main.void __attribute__((destructor)) _d() { flush(); }} // namespace fastiousing fastio::read;using fastio::print;using fastio::flush;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define U32(...) \u32 __VA_ARGS__; \read(__VA_ARGS__)#define U64(...) \u64 __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 3 "main.cpp"#line 2 "/home/maspy/compro/library/flow/mincostflow.hpp"// atcoder library のものを改変namespace internal {template <class E>struct csr {vector<int> start;vector<E> elist;explicit csr(int n, const vector<pair<int, E>>& edges): start(n + 1), elist(edges.size()) {for (auto e: edges) { start[e.first + 1]++; }for (int i = 1; i <= n; i++) { start[i] += start[i - 1]; }auto counter = start;for (auto e: edges) { elist[counter[e.first]++] = e.second; }}};template <class T>struct simple_queue {vector<T> payload;int pos = 0;void reserve(int n) { payload.reserve(n); }int size() const { return int(payload.size()) - pos; }bool empty() const { return pos == int(payload.size()); }void push(const T& t) { payload.push_back(t); }T& front() { return payload[pos]; }void clear() {payload.clear();pos = 0;}void pop() { pos++; }};} // namespace internal/*・atcoder library をすこし改変したもの・DAG = true であれば、負辺 OK （1 回目の最短路を dp で行う）ただし、頂点番号は toposort されていることを仮定している。*/template <class Cap = int, class Cost = ll, bool DAG = false>struct Min_Cost_Flow {public:Min_Cost_Flow() {}explicit Min_Cost_Flow(int n, int source, int sink): n(n), source(source), sink(sink) {assert(0 <= source && source < n);assert(0 <= sink && sink < n);assert(source != sink);}// frm, to, cap, costint add(int frm, int to, Cap cap, Cost cost) {assert(0 <= frm && frm < n);assert(0 <= to && to < n);assert(0 <= cap);assert(DAG || 0 <= cost);if (DAG) assert(frm < to);int m = int(_edges.size());_edges.push_back({frm, to, cap, 0, cost});return m;}void debug() {print("flow graph");print("frm, to, cap, cost");for (auto&& [frm, to, cap, flow, cost]: _edges) {print(frm, to, cap, cost);}}struct edge {int frm, to;Cap cap, flow;Cost cost;};edge get_edge(int i) {int m = int(_edges.size());assert(0 <= i && i < m);return _edges[i];}vector<edge> edges() { return _edges; }// (流量, 費用)pair<Cap, Cost> flow() { return flow(infty<Cap>); }// (流量, 費用)pair<Cap, Cost> flow(Cap flow_limit) { return slope(flow_limit).back(); }vector<pair<Cap, Cost>> slope() { return slope(infty<Cap>); }vector<pair<Cap, Cost>> slope(Cap flow_limit) {int m = int(_edges.size());vector<int> edge_idx(m);auto g = [&]() {vector<int> degree(n), redge_idx(m);vector<pair<int, _edge>> elist;elist.reserve(2 * m);for (int i = 0; i < m; i++) {auto e = _edges[i];edge_idx[i] = degree[e.frm]++;redge_idx[i] = degree[e.to]++;elist.push_back({e.frm, {e.to, -1, e.cap - e.flow, e.cost}});elist.push_back({e.to, {e.frm, -1, e.flow, -e.cost}});}auto _g = internal::csr<_edge>(n, elist);for (int i = 0; i < m; i++) {auto e = _edges[i];edge_idx[i] += _g.start[e.frm];redge_idx[i] += _g.start[e.to];_g.elist[edge_idx[i]].rev = redge_idx[i];_g.elist[redge_idx[i]].rev = edge_idx[i];}return _g;}();auto result = slope(g, flow_limit);for (int i = 0; i < m; i++) {auto e = g.elist[edge_idx[i]];_edges[i].flow = _edges[i].cap - e.cap;}return result;}// O(F(N+M)) くらい使って経路復元vvc<int> path_decomposition() {vvc<int> TO(n);for (auto&& e: edges()) { FOR(e.flow) TO[e.frm].eb(e.to); }vvc<int> res;vc<int> vis(n);while (!TO[source].empty()) {vc<int> path = {source};vis[source] = 1;while (path.back() != sink) {int to = POP(TO[path.back()]);while (vis[to]) { vis[POP(path)] = 0; }path.eb(to), vis[to] = 1;}for (auto&& v: path) vis[v] = 0;res.eb(path);}return res;}private:int n, source, sink;vector<edge> _edges;// inside edgestruct _edge {int to, rev;Cap cap;Cost cost;};vector<pair<Cap, Cost>> slope(internal::csr<_edge>& g, Cap flow_limit) {if (DAG) assert(source == 0 && sink == n - 1);vector<pair<Cost, Cost>> dual_dist(n);vector<int> prev_e(n);vector<bool> vis(n);struct Q {Cost key;int to;bool operator<(Q r) const { return key > r.key; }};vector<int> que_min;vector<Q> que;auto dual_ref = [&]() {for (int i = 0; i < n; i++) { dual_dist[i].second = infty<Cost>; }fill(vis.begin(), vis.end(), false);que_min.clear();que.clear();// que[0..heap_r) was heapifiedsize_t heap_r = 0;dual_dist[source].second = 0;que_min.push_back(source);while (!que_min.empty() || !que.empty()) {int v;if (!que_min.empty()) {v = que_min.back();que_min.pop_back();} else {while (heap_r < que.size()) {heap_r++;push_heap(que.begin(), que.begin() + heap_r);}v = que.front().to;pop_heap(que.begin(), que.end());que.pop_back();heap_r--;}if (vis[v]) continue;vis[v] = true;if (v == sink) break;Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;for (int i = g.start[v]; i < g.start[v + 1]; i++) {auto e = g.elist[i];if (!e.cap) continue;Cost cost = e.cost - dual_dist[e.to].first + dual_v;if (dual_dist[e.to].second > dist_v + cost) {Cost dist_to = dist_v + cost;dual_dist[e.to].second = dist_to;prev_e[e.to] = e.rev;if (dist_to == dist_v) {que_min.push_back(e.to);} else {que.push_back(Q{dist_to, e.to});}}}}if (!vis[sink]) { return false; }for (int v = 0; v < n; v++) {if (!vis[v]) continue;dual_dist[v].first -= dual_dist[sink].second - dual_dist[v].second;}return true;};auto dual_ref_dag = [&]() {FOR(i, n) dual_dist[i].se = infty<Cost>;dual_dist[source].se = 0;fill(vis.begin(), vis.end(), false);vis[0] = true;FOR(v, n) {if (!vis[v]) continue;Cost dual_v = dual_dist[v].fi, dist_v = dual_dist[v].se;for (int i = g.start[v]; i < g.start[v + 1]; i++) {auto e = g.elist[i];if (!e.cap) continue;Cost cost = e.cost - dual_dist[e.to].fi + dual_v;if (dual_dist[e.to].se > dist_v + cost) {vis[e.to] = true;Cost dist_to = dist_v + cost;dual_dist[e.to].second = dist_to;prev_e[e.to] = e.rev;}}}if (!vis[sink]) { return false; }for (int v = 0; v < n; v++) {if (!vis[v]) continue;dual_dist[v].fi -= dual_dist[sink].se - dual_dist[v].se;}return true;};Cap flow = 0;Cost cost = 0, prev_cost_per_flow = -1;vector<pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};while (flow < flow_limit) {if (DAG && flow == 0) {if (!dual_ref_dag()) break;} else {if (!dual_ref()) break;}Cap c = flow_limit - flow;for (int v = sink; v != source; v = g.elist[prev_e[v]].to) {c = min(c, g.elist[g.elist[prev_e[v]].rev].cap);}for (int v = sink; v != source; v = g.elist[prev_e[v]].to) {auto& e = g.elist[prev_e[v]];e.cap += c;g.elist[e.rev].cap -= c;}Cost d = -dual_dist[source].first;flow += c;cost += c * d;if (prev_cost_per_flow == d) { result.pop_back(); }result.push_back({flow, cost});prev_cost_per_flow = d;}return result;}};#line 5 "main.cpp"void solve() {LL(K, N, M);VEC(int, A, K);for (auto& a: A) --a;VEC(int, B, N);int s = N, t = N + 1;Min_Cost_Flow<ll, ll, false> G(N + 2, s, t);for (auto& a: A) G.add(s, a, 1, 0);FOR(i, N) G.add(i, t, B[i], 0);FOR(M) {INT(a, b, c);--a, --b;G.add(a, b, K, c);G.add(b, a, K, c);}auto [a, b] = G.flow();print(b);}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}