結果
問題 | No.2604 Initial Motion |
ユーザー | noya2 |
提出日時 | 2024-01-17 01:10:39 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 10,015 bytes |
コンパイル時間 | 6,889 ms |
コンパイル使用メモリ | 335,636 KB |
実行使用メモリ | 368,528 KB |
最終ジャッジ日時 | 2024-09-28 03:06:52 |
合計ジャッジ時間 | 11,092 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,880 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 61 ms
17,360 KB |
testcase_04 | AC | 67 ms
17,356 KB |
testcase_05 | AC | 59 ms
17,360 KB |
testcase_06 | AC | 58 ms
17,484 KB |
testcase_07 | AC | 63 ms
17,436 KB |
testcase_08 | AC | 65 ms
17,484 KB |
testcase_09 | AC | 59 ms
17,460 KB |
testcase_10 | AC | 63 ms
17,352 KB |
testcase_11 | AC | 62 ms
17,480 KB |
testcase_12 | AC | 59 ms
17,360 KB |
testcase_13 | TLE | - |
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 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { 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...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(vector<T> &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" #include<atcoder/all> #line 2 "/Users/noya2/Desktop/Noya2_library/graph/graph_query.hpp" #line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp" #line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp" #include<ranges> #line 7 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp" namespace noya2 { template<class E> struct csr { csr (int n_ = 0, int m_ = -1) : n(n_), m(m_) { if (m >= 0){ es.reserve(m); start.reserve(m); } if (m == 0){ build(); } } int add(int idx, E elem){ int eid = start.size(); es.emplace_back(elem); start.emplace_back(idx); if (eid+1 == m) build(); return eid; } void build(){ if (m == -2) return ; m = start.size(); std::vector<E> nes(m); std::vector<int> nstart(n+2,0); for (int i = 0; i < m; i++) nstart[start[i]+2]++; for (int i = 1; i < n; i++) nstart[i+2] += nstart[i+1]; for (int i = 0; i < m; i++) nes[nstart[start[i]+1]++] = es[i]; swap(es,nes); swap(start,nstart); m = -2; } const auto operator[](int idx) const { assert(m == -2); return std::ranges::subrange(es.begin()+start[idx],es.begin()+start[idx+1]); } private: int n, m; std::vector<E> es; std::vector<int> start; }; } // namespace noya2 #line 5 "/Users/noya2/Desktop/Noya2_library/graph/graph_query.hpp" namespace noya2 { template<typename Cost> struct Graph { int n; csr<pair<int,Cost>> g; Cost dist_inf; Graph (int n_ = 0, int m_ = -1) : n(n_), g(n_,m_) { dist_inf = numeric_limits<Cost>::max() / 2; } int add_edge(int u, int v, Cost cost = 1){ return g.add(u,pair<int,Cost>(v,cost)); } void build(){ g.build(); } void set_inf(Cost new_inf){ dist_inf = new_inf; } vector<Cost> dijkstra(int s){ vector<Cost> dist(n,dist_inf); dist[s] = 0; using P = pair<Cost,int>; priority_queue<P,vector<P>,greater<P>> pque; pque.push(P(0,s)); while (!pque.empty()){ auto [d, v] = pque.top(); pque.pop(); if (dist[v] < d) continue; for (auto [u, c] : g[v]){ if (chmin(dist[u],d+c)){ pque.push(P(dist[u],u)); } } } return dist; } vector<int> reconstruct(int s, int t, const vector<Cost> &dist){ if (dist[t] == linf) return {}; vector<int> from(n,-1); queue<int> que; que.push(s); while (!que.empty()){ int v = que.front(); que.pop(); for (auto [u, c] : g[v]){ if (from[u] == -1 && dist[u] == dist[v] + c){ from[u] = v; que.push(u); } } } vector<int> ans = {t}; while (t != s){ t = from[t]; ans.emplace_back(t); } reverse(all(ans)); return ans; } vector<Cost> bfs01(int s){ vector<Cost> dist(n,iinf); dist[s] = 0; deque<int> que; que.push_back(s); while (!que.empty()){ int v = que.front(); que.pop_front(); for (auto [u, c] : g[v]){ if (chmin(dist[u],dist[v]+c)){ if (c == 0) que.push_front(u); else que.push_back(u); } } } return dist; } vector<Cost> bellman_ford(int s, bool &ng_cycle){ vector<Cost> dist(n,dist_inf); vector<int> ng; dist[s] = 0; int tm = 0; while (tm < n){ bool finish = true; for (int v = 0; v < n; v++){ if (dist[v] == dist_inf) continue; for (auto [u, c] : g[v]){ if (chmin(dist[u],dist[v]+c)){ finish = false; if (tm == n-1) ng.emplace_back(u); } } } if (finish) break; tm++; } ng_cycle = (tm == n); if (ng_cycle){ for (auto v : ng) dist[v] = -dist_inf; tm = n; while (tm--){ for (int v = 0; v < n; v++){ if (dist[v] != -dist_inf) continue; for (auto [u, c] : g[v]){ dist[u] = -dist_inf; } } } } return dist; } vector<vector<Cost>> warshall_floyd(){ vector<vector<Cost>> dist(n,vector<Cost>(n,dist_inf)); rep(v,n){ dist[v][v] = 0; for (auto [u, c] : g[v]){ chmin(dist[v][u],c); } } rep(k,n) rep(i,n) rep(j,n){ chmin(dist[i][j],dist[i][k]+dist[k][j]); } return dist; } const auto operator[](int idx) const { return g[idx]; } }; } // namespace noya2 #line 5 "c.cpp" void solve(){ int k, n, m; in(k,n,m); Graph<ll> g(n,m*2); vector<int> a(k), b(n); in(a,b); while (m--){ int u, v; in(u,v); u--, v--; ll c; in(c); g.add_edge(u,v,c); g.add_edge(v,u,c); } vector<vector<ll>> dist(n); rep(i,n){ dist[i] = g.dijkstra(i); } atcoder::mcf_graph<ll,ll> mcfg(n*2+2); int s = n*2, t = n*2+1; vector<int> cnt(n,0); rep(i,k) cnt[--a[i]]++; rep(v,n){ mcfg.add_edge(s,v,cnt[v],0); rep(u,n){ mcfg.add_edge(v,n+u,k,dist[v][u]); } mcfg.add_edge(n+v,t,b[v],0); } out(mcfg.flow(s,t).second); } int main(){ int t = 1; //in(t); while (t--) { solve(); } }