結果
問題 | No.2320 Game World for PvP |
ユーザー |
👑 |
提出日時 | 2023-05-27 00:24:33 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 15,066 bytes |
コンパイル時間 | 4,350 ms |
コンパイル使用メモリ | 267,988 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-25 11:53:53 |
合計ジャッジ時間 | 5,839 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
// start A.cpp// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;template <class T>using pq = priority_queue<T>;template <class T>using qp = priority_queue<T, vector<T>, greater<T>>;#define vec(T, A, ...) vector<T> A(__VA_ARGS__);#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));#ifndef RIN__LOCAL#define endl "\n"#endif#define spa ' '#define len(A) A.size()#define all(A) begin(A), end(A)#define fori1(a) for (ll _ = 0; _ < (a); _++)#define fori2(i, a) for (ll i = 0; i < (a); i++)#define fori3(i, a, b) for (ll i = (a); i < (b); i++)#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))#define overload4(a, b, c, d, e, ...) e#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)vector<char> stoc(string &S) {int n = S.size();vector<char> ret(n);for (int i = 0; i < n; i++) ret[i] = S[i];return ret;}#define INT(...)\int __VA_ARGS__;\inp(__VA_ARGS__);#define LL(...)\ll __VA_ARGS__;\inp(__VA_ARGS__);#define STRING(...)\string __VA_ARGS__;\inp(__VA_ARGS__);#define CHAR(...)\char __VA_ARGS__;\inp(__VA_ARGS__);#define VEC(T, A, n)\vector<T> A(n);\inp(A);#define VVEC(T, A, n, m)\vector<vector<T>> A(n, vector<T>(m));\inp(A);const ll MOD1 = 1000000007;const ll MOD9 = 998244353;template <class T>auto min(const T &a) {return *min_element(all(a));}template <class T>auto max(const T &a) {return *max_element(all(a));}template <class T, class S>auto clamp(T &a, const S &l, const S &r) {return (a > r ? r : a < l ? l : a);}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);}template <class T, class S>inline bool chclamp(T &a, const S &l, const S &r) {auto b = clamp(a, l, r);return (a != b ? a = b, 1 : 0);}void FLUSH() {cout << flush;}void print() {cout << endl;}template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {cout << head;if (sizeof...(Tail)) cout << spa;print(forward<Tail>(tail)...);}template <typename T>void print(vector<T> &A) {int n = A.size();for (int i = 0; i < n; i++) {cout << A[i];if (i != n - 1) cout << ' ';}cout << endl;}template <typename T>void print(vector<vector<T>> &A) {for (auto &row : A) print(row);}template <typename T, typename S>void print(pair<T, S> &A) {cout << A.first << spa << A.second << endl;}template <typename T, typename S>void print(vector<pair<T, S>> &A) {for (auto &row : A) print(row);}template <typename T, typename S>void prisep(vector<T> &A, S sep) {int n = A.size();for (int i = 0; i < n; i++) {cout << A[i];if (i != n - 1) cout << sep;}cout << endl;}template <typename T, typename S>void priend(T A, S end) {cout << A << end;}template <typename T>void priend(T A) {priend(A, spa);}template <class... T>void inp(T &... a) {(cin >> ... >> a);}template <typename T>void inp(vector<T> &A) {for (auto &a : A) cin >> a;}template <typename T>void inp(vector<vector<T>> &A) {for (auto &row : A) inp(row);}template <typename T, typename S>void inp(pair<T, S> &A) {inp(A.first, A.second);}template <typename T, typename S>void inp(vector<pair<T, S>> &A) {for (auto &row : A) inp(row.first, row.second);}template <typename T>T sum(vector<T> &A) {T tot = 0;for (auto a : A) tot += a;return tot;}template <typename T>vector<T> compression(vector<T> X) {sort(all(X));X.erase(unique(all(X)), X.end());return X;}vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<int>> edges(n, vector<int>());for (int i = 0; i < m; i++) {INT(u, v);u -= indexed;v -= indexed;edges[u].push_back(v);if (!direct) edges[v].push_back(u);}return edges;}vector<vector<int>> read_tree(int n, int indexed = 1) {return read_edges(n, n - 1, false, indexed);}template <typename T>vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());for (int i = 0; i < m; i++) {INT(u, v);T w;inp(w);u -= indexed;v -= indexed;edges[u].push_back({v, w});if (!direct) edges[v].push_back({u, w});}return edges;}template <typename T>vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {return read_wedges<T>(n, n - 1, false, indexed);}inline bool yes(bool f = true) {cout << (f ? "yes" : "no") << endl;return f;}inline bool Yes(bool f = true) {cout << (f ? "Yes" : "No") << endl;return f;}inline bool YES(bool f = true) {cout << (f ? "YES" : "NO") << endl;return f;}inline bool no(bool f = true) {cout << (!f ? "yes" : "no") << endl;return f;}inline bool No(bool f = true) {cout << (!f ? "Yes" : "No") << endl;return f;}inline bool NO(bool f = true) {cout << (!f ? "YES" : "NO") << endl;return f;}// start atcoder/maxflow.hpp#ifndef ATCODER_MAXFLOW_HPP#define ATCODER_MAXFLOW_HPP 1#include <algorithm>#include <cassert>#include <limits>#include <queue>#include <vector>// start atcoder/internal_queue.hpp#ifndef ATCODER_INTERNAL_QUEUE_HPP#define ATCODER_INTERNAL_QUEUE_HPP 1#include <vector>namespace atcoder {namespace internal {template <class T>struct simple_queue {std::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} // namespace atcoder#endif // ATCODER_INTERNAL_QUEUE_HPP// end atcoder/internal_queue.hpp// restart atcoder/maxflow.hppnamespace atcoder {template <class Cap>struct mf_graph {public:mf_graph() : _n(0) {}explicit mf_graph(int n) : _n(n), g(n) {}int add_edge(int from, int to, Cap cap) {assert(0 <= from && from < _n);assert(0 <= to && to < _n);assert(0 <= cap);int m = int(pos.size());pos.push_back({from, int(g[from].size())});int from_id = int(g[from].size());int to_id = int(g[to].size());if (from == to) to_id++;g[from].push_back(_edge{to, to_id, cap});g[to].push_back(_edge{from, from_id, 0});return m;}struct edge {int from, to;Cap cap, flow;};edge get_edge(int i) {int m = int(pos.size());assert(0 <= i && i < m);auto _e = g[pos[i].first][pos[i].second];auto _re = g[_e.to][_e.rev];return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};}std::vector<edge> edges() {int m = int(pos.size());std::vector<edge> result;for (int i = 0; i < m; i++) {result.push_back(get_edge(i));}return result;}void change_edge(int i, Cap new_cap, Cap new_flow) {int m = int(pos.size());assert(0 <= i && i < m);assert(0 <= new_flow && new_flow <= new_cap);auto &_e = g[pos[i].first][pos[i].second];auto &_re = g[_e.to][_e.rev];_e.cap = new_cap - new_flow;_re.cap = new_flow;}Cap flow(int s, int t) {return flow(s, t, std::numeric_limits<Cap>::max());}Cap flow(int s, int t, Cap flow_limit) {assert(0 <= s && s < _n);assert(0 <= t && t < _n);assert(s != t);std::vector<int> level(_n), iter(_n);internal::simple_queue<int> que;auto bfs = [&]() {std::fill(level.begin(), level.end(), -1);level[s] = 0;que.clear();que.push(s);while (!que.empty()) {int v = que.front();que.pop();for (auto e : g[v]) {if (e.cap == 0 || level[e.to] >= 0) continue;level[e.to] = level[v] + 1;if (e.to == t) return;que.push(e.to);}}};auto dfs = [&](auto self, int v, Cap up) {if (v == s) return up;Cap res = 0;int level_v = level[v];for (int &i = iter[v]; i < int(g[v].size()); i++) {_edge &e = g[v][i];if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));if (d <= 0) continue;g[v][i].cap += d;g[e.to][e.rev].cap -= d;res += d;if (res == up) return res;}level[v] = _n;return res;};Cap flow = 0;while (flow < flow_limit) {bfs();if (level[t] == -1) break;std::fill(iter.begin(), iter.end(), 0);Cap f = dfs(dfs, t, flow_limit - flow);if (!f) break;flow += f;}return flow;}std::vector<bool> min_cut(int s) {std::vector<bool> visited(_n);internal::simple_queue<int> que;que.push(s);while (!que.empty()) {int p = que.front();que.pop();visited[p] = true;for (auto e : g[p]) {if (e.cap && !visited[e.to]) {visited[e.to] = true;que.push(e.to);}}}return visited;}private:int _n;struct _edge {int to, rev;Cap cap;};std::vector<std::pair<int, int>> pos;std::vector<std::vector<_edge>> g;};} // namespace atcoder#endif // ATCODER_MAXFLOW_HPP// end atcoder/maxflow.hpp// restart A.cppvoid solve() {INT(n, S, T);vec(int, er, n, -1);fori(S) {INT(e);er[e - 1] = 0;}fori(T) {INT(r);er[r - 1] = 1;}VVEC(ll, C, n, n);ll ans = 0;fori(i, n) fori(j, i + 1, n) {if (er[i] != -1 && er[i] == er[j]) ans += C[i][j];}const ll inf = 1LL << 60;atcoder::mf_graph<ll> G(2 + n + n * n);int s = n * n + n;int t = s + 1;fori(i, n) {if (er[i] != -1) continue;ll e = 0;ll r = 0;fori(j, n) {if (er[j] == 0)e += C[i][j];else if (er[j] == 1)r += C[i][j];}ans += e;G.add_edge(s, i, e);ans += r;G.add_edge(i, t, r);fori(j, i + 1, n) {if (er[j] == -1) {int p = n + i * n + j;ans += C[i][j];G.add_edge(s, p, C[i][j]);G.add_edge(p, i, inf);G.add_edge(p, j, inf);p = n + j * n + i;ans += C[i][j];G.add_edge(p, t, C[i][j]);G.add_edge(i, p, inf);G.add_edge(j, p, inf);}}}ans -= G.flow(s, t);print(ans);}int main() {cin.tie(0)->sync_with_stdio(0);// cout << fixed << setprecision(12);int t;t = 1;// cin >> t;while (t--) solve();return 0;}// end A.cpp