結果
問題 | No.788 トラックの移動 |
ユーザー | jell |
提出日時 | 2019-03-02 09:26:05 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 435 ms / 2,000 ms |
コード長 | 7,151 bytes |
コンパイル時間 | 1,894 ms |
コンパイル使用メモリ | 181,012 KB |
実行使用メモリ | 36,368 KB |
最終ジャッジ日時 | 2024-05-08 22:59:59 |
合計ジャッジ時間 | 4,837 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 405 ms
36,368 KB |
testcase_01 | AC | 12 ms
36,224 KB |
testcase_02 | AC | 12 ms
36,220 KB |
testcase_03 | AC | 12 ms
36,184 KB |
testcase_04 | AC | 102 ms
36,224 KB |
testcase_05 | AC | 395 ms
36,256 KB |
testcase_06 | AC | 404 ms
36,224 KB |
testcase_07 | AC | 12 ms
36,244 KB |
testcase_08 | AC | 12 ms
36,260 KB |
testcase_09 | AC | 12 ms
36,188 KB |
testcase_10 | AC | 12 ms
36,212 KB |
testcase_11 | AC | 12 ms
36,224 KB |
testcase_12 | AC | 12 ms
36,180 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 72 ms
36,212 KB |
testcase_16 | AC | 435 ms
36,228 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using i64 = int_fast64_t; using ui64 = uint_fast64_t; using db = long double; using pii = pair<int, int>; using pli = pair<int_fast64_t, int>; using pll = pair<int_fast64_t, int_fast64_t>; using pdi = pair<double, int>; template <class T> using vct = vector<T>; template <class T> using heap = priority_queue<T>; template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <class T> constexpr T inf = numeric_limits<T>::max() / 4 - 1; constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0}; constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0}; constexpr long double gold = 1.618033988; constexpr long double eps = 1e-15; #define stdout_precision 10 #define stderr_precision 2 #define itr(i,v) for(auto i = begin(v); i != end(v); ++i) #define ritr(i,v) for(auto i = rbegin(v); i != rend(v); ++i) #define rep(i,n) for(int i = 0; i < (n); ++i) #define all(v) begin(v), end(v) #define rall(v) rbegin(v), rend(v) #define fir first #define sec second #define fro front #define bac back #define u_map unordered_map #define u_set unordered_set #define l_bnd lower_bound #define u_bnd upper_bound #define rsz resize #define ers erase #define emp emplace #define emf emplace_front #define emb emplace_back #define pof pop_front #define pob pop_back #define mkp make_pair #define mkt make_tuple #define popcnt __builtin_popcount struct setupper { setupper() { ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr); std::cerr.tie(nullptr); std::cout << fixed << setprecision(stdout_precision); std::cerr << fixed << setprecision(stderr_precision); // #ifdef Local // std::cerr << "\n---stderr---\n"; // auto print_atexit = []() { // std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n"; // std::cerr << "------------\n"; // }; // atexit((void(*)())print_atexit); // #endif } } setupper_; namespace std { template <class T> void hash_combine(size_t &seed, T const &key) { seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2); } template <class T, class U> struct hash<pair<T,U>> { size_t operator()(pair<T,U> const &pr) const { size_t seed = 0; hash_combine(seed,pr.first); hash_combine(seed,pr.second); return seed; } }; template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc { static void apply(size_t& seed, Tup const& tup) { hashval_calc<Tup, index - 1>::apply(seed, tup); hash_combine(seed,get<index>(tup)); } }; template <class Tup> struct hashval_calc<Tup,0> { static void apply(size_t& seed, Tup const& tup) { hash_combine(seed,get<0>(tup)); } }; template <class ...T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const& tup) const { size_t seed = 0; hashval_calc<tuple<T...>>::apply(seed,tup); return seed; } }; } template <class T, class U> istream &operator>> (istream &s, pair<T,U> &p) { return s >> p.first >> p.second; } template <class T, class U> ostream &operator<< (ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; } template <class T> ostream &operator<< (ostream &s, const vector<T> &v) { for(size_t i = 0; i < v.size(); ++i) s << (i ? " " : "") << v[i]; return s; } #define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\ dump_func(__VA_ARGS__) template <class T> void dump_func(T x) { cerr << x << '\n'; } template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); } template <class T = int> T read() { T x; return cin >> x, x; } template <class T> void write(T x) { cout << x << '\n'; } template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); } void writeln() {} template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); } #define esc(...) writeln(__VA_ARGS__), exit(0) namespace updater { template <class T> static void add(T &x, const T &y) { x += y; } template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; } template <class T> static void mul(T &x, const T &y) { x *= y; } template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); } template <class T> static bool chmax(T &x, const T &y) { return x < y ? x = y,true : false; } template <class T> static bool chmin(T &x, const T &y) { return x > y ? x = y,true : false; } }; using updater::chmax; using updater::chmin; template <class T> T minf(const T &x, const T &y) { return min(x,y); } template <class T> T mixf(const T &x, const T &y) { return max(x,y); } bool bit(i64 n, uint8_t e) { return (n >> e) & 1; } i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); } int ilog(uint64_t x, uint64_t b = 2) { return x ? 1 + ilog(x / b,b) : -1; } template <class F> i64 binry(i64 ok, i64 ng, const F &fn) { while (abs(ok - ng) > 1) { i64 mid = (ok + ng) / 2; (fn(mid) ? ok : ng) = mid; } return ok; } template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array,(T*)(array + N),val); } template <class A> void cmprs(A ary[], size_t n) { vector<A> tmp(ary,ary + n); tmp.erase(unique(begin(tmp),end(tmp)), end(tmp)); for(A *i = ary; i != ary + n; ++i) *i = l_bnd(all(tmp),*i) - begin(tmp); } template <class T> void cmprs(vector<T> &v) { vector<T> tmp = v; sort(begin(tmp),end(tmp)); tmp.erase(unique(begin(tmp),end(tmp)), end(tmp)); for(auto i = begin(v); i != end(v); ++i) *i = l_bnd(all(tmp),*i) - begin(tmp); } template <class F> void for_subset(uint_fast64_t s, const F &fn) { uint_fast64_t tmp = s; do { fn(tmp); } while((--tmp &= s) != s); } int n,m,L; int t[2048]; i64 dist[2048][2048]; vector<pii> G[2048]; vector<int> exi; signed main() { cin>>n>>m>>L; rep(i,n) cin>>t[i]; rep(i,n) if(t[i]) exi.push_back(i+1); rep(i,m) { int a,b,c; cin>>a>>b>>c; G[a].emplace_back(b,c); G[b].emplace_back(a,c); } if(exi.size()==1) esc(0); init(dist,inf<i64>); for(int i=1;i<=n;++i) { minheap<pli> qu; qu.emplace(0,i); dist[i][i]=0; while(!qu.empty()) { auto t=qu.top(); qu.pop(); if(t.fir>dist[i][t.sec]) continue; for(auto e:G[t.sec]) { if(chmin(dist[i][e.fir],t.fir+e.sec)) { qu.emplace(dist[i][e.fir],e.fir); } } } } i64 ans=inf<i64>; for(int v=1; v<=n; ++v) { i64 tmp=inf<i64>; for(int i:exi) { chmin(tmp,dist[L][i]-dist[v][i]); } for(int i:exi) { assert(dist[v][i]!=inf<i64>); tmp+=dist[v][i]*t[i-1]*2; } chmin(ans,tmp); } writeln(ans); }