結果
問題 | No.2604 Initial Motion |
ユーザー |
![]() |
提出日時 | 2024-01-12 23:16:39 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 668 ms / 3,000 ms |
コード長 | 3,738 bytes |
コンパイル時間 | 2,266 ms |
コンパイル使用メモリ | 156,464 KB |
最終ジャッジ日時 | 2025-02-18 19:05:30 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 39 |
ソースコード
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<numeric>#include<cmath>#include<utility>#include<tuple>#include<cstdint>#include<cstdio>#include<iomanip>#include<map>#include<queue>#include<set>#include<stack>#include<deque>#include<unordered_map>#include<unordered_set>#include<bitset>#include<cctype>#include<chrono>#include<random>#include<cassert>#include<cstddef>#include<iterator>#include<string_view>#include<type_traits>#ifdef LOCAL# include "debug_print.hpp"# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifusing namespace std;#define rep(i,n) for(int i=0; i<(n); i++)#define rrep(i,n) for(int i=(n)-1; i>=0; i--)#define FOR(i,a,b) for(int i=(a); i<(b); i++)#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define pb push_backusing ll = long long;using D = double;using LD = long double;using P = pair<int, int>;template<typename T> using PQ = priority_queue<T,vector<T>>;template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}template<typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << " " << p.second;return os;}template<typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template<typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}void in() {}template<typename T, class... U>void in(T &t, U &...u) {cin >> t;in(u...);}void out() { cout << "\n"; }template<typename T, class... U, char sep = ' '>void out(const T &t, const U &...u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template<typename T, class... U, char sep = ' '>void outr(const T &t, const U &...u) {cout << t;outr(u...);}constexpr ll inf = 1e18;#include "atcoder/mincostflow.hpp"int main(){ios_base::sync_with_stdio(false);cin.tie(nullptr);int k,n,m; in(k,n,m);vector<int> a(k),b(n); in(a,b);rep(i,k) a[i]--;vector<vector<pair<int,ll>>> g(n);vector<int> u(m),v(m);vector<ll> d(m);rep(i,m){in(u[i],v[i],d[i]); u[i]--; v[i]--;g[u[i]].pb({v[i],d[i]});g[v[i]].pb({u[i],d[i]});}ll dist[n][n];rep(i,n)rep(j,n) dist[i][j] = inf;rep(st,n){minPQ<pair<ll,int>> pq;pq.push({0,st});dist[st][st] = 0;while(pq.size()){auto [dt, fr] = pq.top(); pq.pop();if(dist[st][fr] < dt) continue;for(auto [to, wt] : g[fr]){if(dist[st][to] > dt + wt){dist[st][to] = dt+wt;pq.push({dist[st][to],to});}}}}atcoder::mcf_graph<int,ll> fg(n+2);int source = n, sink = n+1;rep(i,k) fg.add_edge(source, a[i], 1, 0);rep(i,n) fg.add_edge(i, sink, b[i], 0);rep(i,m){fg.add_edge(u[i],v[i],k, d[i]);fg.add_edge(v[i],u[i],k, d[i]);}auto [mf, mc] = fg.flow(source, sink, k);out(mc);}