結果
問題 | No.2604 Initial Motion |
ユーザー | akiaa11 |
提出日時 | 2024-01-12 22:55:22 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 318 ms / 3,000 ms |
コード長 | 3,699 bytes |
コンパイル時間 | 5,201 ms |
コンパイル使用メモリ | 284,100 KB |
実行使用メモリ | 36,736 KB |
最終ジャッジ日時 | 2024-01-12 22:55:45 |
合計ジャッジ時間 | 10,647 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 8 ms
6,676 KB |
testcase_04 | AC | 9 ms
6,676 KB |
testcase_05 | AC | 8 ms
6,676 KB |
testcase_06 | AC | 8 ms
6,676 KB |
testcase_07 | AC | 9 ms
6,676 KB |
testcase_08 | AC | 9 ms
6,676 KB |
testcase_09 | AC | 8 ms
6,676 KB |
testcase_10 | AC | 9 ms
6,676 KB |
testcase_11 | AC | 8 ms
6,676 KB |
testcase_12 | AC | 8 ms
6,676 KB |
testcase_13 | AC | 175 ms
23,108 KB |
testcase_14 | AC | 110 ms
12,252 KB |
testcase_15 | AC | 77 ms
12,764 KB |
testcase_16 | AC | 146 ms
19,456 KB |
testcase_17 | AC | 230 ms
35,840 KB |
testcase_18 | AC | 209 ms
30,932 KB |
testcase_19 | AC | 204 ms
27,776 KB |
testcase_20 | AC | 146 ms
17,904 KB |
testcase_21 | AC | 113 ms
13,028 KB |
testcase_22 | AC | 193 ms
28,020 KB |
testcase_23 | AC | 126 ms
14,080 KB |
testcase_24 | AC | 164 ms
21,376 KB |
testcase_25 | AC | 142 ms
36,608 KB |
testcase_26 | AC | 140 ms
16,768 KB |
testcase_27 | AC | 93 ms
10,368 KB |
testcase_28 | AC | 126 ms
14,848 KB |
testcase_29 | AC | 171 ms
22,628 KB |
testcase_30 | AC | 102 ms
11,520 KB |
testcase_31 | AC | 140 ms
16,640 KB |
testcase_32 | AC | 88 ms
16,896 KB |
testcase_33 | AC | 35 ms
36,736 KB |
testcase_34 | AC | 63 ms
36,736 KB |
testcase_35 | AC | 169 ms
36,736 KB |
testcase_36 | AC | 75 ms
36,736 KB |
testcase_37 | AC | 12 ms
12,764 KB |
testcase_38 | AC | 2 ms
6,676 KB |
testcase_39 | AC | 2 ms
6,676 KB |
testcase_40 | AC | 318 ms
36,736 KB |
testcase_41 | AC | 294 ms
36,736 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using vectp=vector<tp>; using vectpll=vector<tpll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;} constexpr ll INF=numeric_limits<ll>::max() / 4; constexpr int inf=numeric_limits<int>::max() / 2; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int k, n, m;cin>>k>>n>>m; vector g(n, vecll(n, INF)); veci a(k), b(n); rep(i, k) cin>>a[i], a[i]--; rep(i, n) cin>>b[i]; rep(i, m){ int c, d;cin>>c>>d; c--, d--; ll w;cin>>w; chmin(g[c][d], w); chmin(g[d][c], w); } veci cnt(n); rep(i, k) cnt[a[i]]++; mcf_graph<int, ll> g2(n * 2 + 2); int s = 2 * n, t = 2 * n + 1; rep(i, n){ g2.add_edge(s, i, cnt[i], 0); g2.add_edge(i, i + n, k + 1, 0); rep(j, n) if(g[i][j] != INF){ g2.add_edge(i, j, k + 1, g[i][j]); g2.add_edge(i, j + n, k + 1, g[i][j]); } g2.add_edge(i + n, t, b[i], 0); } auto r = g2.flow(s, t, k); Log(cnt); Log(r); cout<<r.se<<endl; }