結果
問題 | No.788 トラックの移動 |
ユーザー | hamray |
提出日時 | 2021-06-18 13:11:30 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 992 ms / 2,000 ms |
コード長 | 5,435 bytes |
コンパイル時間 | 2,222 ms |
コンパイル使用メモリ | 181,808 KB |
実行使用メモリ | 35,124 KB |
最終ジャッジ日時 | 2024-12-15 07:12:20 |
合計ジャッジ時間 | 8,183 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 948 ms
35,028 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 217 ms
20,160 KB |
testcase_05 | AC | 946 ms
35,124 KB |
testcase_06 | AC | 933 ms
35,096 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 1 ms
6,816 KB |
testcase_10 | AC | 2 ms
6,816 KB |
testcase_11 | AC | 2 ms
6,816 KB |
testcase_12 | AC | 2 ms
6,820 KB |
testcase_13 | AC | 2 ms
6,816 KB |
testcase_14 | AC | 2 ms
6,816 KB |
testcase_15 | AC | 534 ms
34,964 KB |
testcase_16 | AC | 992 ms
35,064 KB |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:188:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 188 | auto[c, v] = pq.top(); pq.pop(); | ^ main.cpp:190:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 190 | for(auto[u, cost]: g[v]) { | ^
ソースコード
#include <bits/stdc++.h> //#include <atcoder/all> //using namespace atcoder; #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimize("Ofast") #pragma GCC optimization ("unroll-loops") using namespace std; typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef pair<int, int> pii; typedef pair<long long, long long> PLL; typedef pair<int, PII> TIII; typedef long long ll; typedef long double ld; typedef unsigned long long ull; #define FOR(i, s, n) for (int i = s; i < (int)n; ++i) #define REP(i, n) FOR(i, 0, n) #define rep(i, a, b) for (int i = a; i < (b); ++i) #define trav(a, x) for (auto &a : x) #define all(x) x.begin(), x.end() template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;} template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;} const double EPS = 1e-12, PI = acos(-1); const double pi = 3.141592653589793238462643383279; //ここから編集 typedef string::const_iterator State; ll GCD(ll a, ll b){ return (b==0)?a:GCD(b, a%b); } ll LCM(ll a, ll b){ return a/GCD(a, b) * b; } template< int mod > struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } }; using modint = ModInt< 1000000007 >; using modint9 = ModInt<998244353>; template< typename T > struct Combination { vector< T > _fact, _rfact, _inv; Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) { _fact[0] = _rfact[sz] = _inv[0] = 1; for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i; _rfact[sz] /= _fact[sz]; for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1); for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1]; } inline T fact(int k) const { return _fact[k]; } inline T rfact(int k) const { return _rfact[k]; } inline T inv(int k) const { return _inv[k]; } T P(int n, int r) const { if(r < 0 || n < r) return 0; return fact(n) * rfact(n - r); } T C(int p, int q) const { if(q < 0 || p < q) return 0; return fact(p) * rfact(q) * rfact(p - q); } T H(int n, int r) const { if(n < 0 || r < 0) return (0); return r == 0 ? 1 : C(n + r - 1, r); } }; ll modpow(ll x, ll n, ll mod = 100000007) { ll res = 1; while(n) { if(n&1) res = (res * x)%mod; x = (x*x)%mod; n >>= 1; } return res; } ll dist[2010][2010]; vector<vector<pair<ll,ll>>> g(2010); int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(8); int N, M, L; cin >> N >> M >> L; L--; REP(i,N) REP(j,N) dist[i][j] = 1e9; vector<ll> t(N); REP(i,N) cin >> t[i]; REP(i,M) { int a, b, c; cin >> a >> b >> c; a--; b--; g[a].push_back({b, c}); g[b].push_back({a, c}); } REP(i,N) { dist[i][i] = 0; priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq; pq.push({dist[i][i], i}); while(pq.size()) { auto[c, v] = pq.top(); pq.pop(); if(dist[i][v] < c) continue; for(auto[u, cost]: g[v]) { if(dist[i][u] > dist[i][v] + cost) { dist[i][u] = dist[i][v] + cost; pq.push({dist[i][u], u}); } } } } ll ans = (1LL<<60); REP(i,N) { priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq; REP(j,N) { if(t[j] == 0) continue; pq.push({dist[L][j]-dist[i][j], j}); } if(pq.size() <= 1) { ans = 0; break; } ll tmp = dist[L][pq.top().second] + dist[pq.top().second][i] + (t[pq.top().second]-1) * (2 * dist[pq.top().second][i]); pq.pop(); while(pq.size()) { tmp += 2 * dist[i][pq.top().second] * t[pq.top().second]; pq.pop(); } //cout << i << " " << tmp << endl; ans = min(ans, tmp); } cout << ans << endl; return 0; }