結果
| 問題 | No.788 トラックの移動 |
| ユーザー |
 recososo
|
| 提出日時 | 2022-10-30 21:12:27 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 508 ms / 2,000 ms |
| コード長 | 7,870 bytes |
| コンパイル時間 | 2,886 ms |
| コンパイル使用メモリ | 235,356 KB |
| 最終ジャッジ日時 | 2025-02-08 16:11:59 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 14 |
ソースコード
#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;#define REP(i, n) for (int i = 0; i < (n); ++i)#define REPR(i, n) for (int i = n - 1; i >= 0; --i)#define FOR(i, m, n) for (int i = m; i < n; ++i)#define FORR(i, m, n) for (int i = m; i >= n; --i)#define ALL(v) (v).begin(),(v).end()#define ALLR(v) (v).rbegin(),(v).rend()#define SORT(v) sort(ALL(v))#define RSORT(v) sort(ALLR(v))#define REV(v) reverse(ALL(v))#define UNIQUE(x) SORT(x), x.erase(unique(ALL(x)), x.end())#define fi first#define se second#define PB push_back#define EB emplace_backusing pii = pair<int, int>;using pll = pair<ll, ll>;template <typename T> using vc = vector<T>;template <typename T> using vvc = vector<vc<T>>;template <typename T> using vvvc = vector<vvc<T>>;using vi = vc<int>;using vl = vc<ll>;using vpi = vc<pii>;using vpl = vc<pll>;// noimi#define INT(...) int __VA_ARGS__;IN(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;IN(__VA_ARGS__)#define STR(...) string __VA_ARGS__;IN(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;IN(__VA_ARGS__)#define VEC(type, name, size) vector<type> name(size);IN(name)#define VEC2(type, name1, name2, size) vector<type> name1(size), name2(size);for(int i = 0; i < size; i++) IN(name1[i], name2[i])#define VEC3(type, name1, name2, name3, size) vector<type> name1(size), name2(size), name3(size);for(int i = 0; i < size; i++) IN(name1[i], name2[i],name3[i])#define VEC4(type, name1, name2, name3, name4, size) vector<type> name1(size), name2(size), name3(size), name4(size); for(int i = 0; i < size; i++)IN(name1[i], name2[i], name3[i], name4[i]);#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w));IN(name)int scan() { return getchar(); }void scan(int &a) { cin >> a; }void scan(long long &a) { cin >> a; }void scan(char &a) { cin >> a; }void scan(double &a) { cin >> a; }void scan(string &a) { cin >> a; }template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }template <class T> void scan(vector<T> &);template <class T> void scan(vector<T> &a) {for(auto &i : a) scan(i);}template <class T> void scan(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {scan(head);IN(tail...);}// tute7627template<typename T> using PQ = priority_queue<T>;template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;template<typename T>void stout(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j]<<" \n"[j==w-1];}};template<typename T>void stout(const T &v,ll n){for(ll i=0;i<n;i++)cout<<v[i]<<" \n"[i==n-1];};template<typename T>void stout(const vector<T>&v){stout(v,v.size());}template<typename T>void stout(const vector<vector<T>>&v){for(auto &vv:v)stout(vv,vv.size());}template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cerr<<v[i][j]<<" \n"[j==w-1];}};template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cerr<<v[i]<<" \n"[i==n-1];};template<typename T>void debug(const vector<T>&v){debug(v,v.size());}template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}template<typename T>void debug(stack<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}template<typename T>void debug(queue<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop();}cerr<<endl;}template<typename T>void debug(deque<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop_front();}cerr<<endl;}template<typename T>void debug(PQ<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}template<typename T>void debug(QP<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}template<typename T>void debug(const set<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;}template<typename T>void debug(const multiset<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;}template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cerr<<z<<" ";cerr<<endl;}template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cerr<<"["<<z.first<<"]="<<z.second<<",";cerr<<endl;}int popcount(ll x){return __builtin_popcountll(x);};int poplow(ll x){return __builtin_ctzll(x);};int pophigh(ll x){return 63 - __builtin_clzll(x);};void OUT() {cout << "\n";}template <class Head, class... Tail>void OUT(Head&& head, Tail&&... tail){cout << head;if(sizeof...(tail)) cout << " ";OUT(move(tail)...);}void ERR() {cerr << "\n";}template <class Head, class... Tail>void ERR(Head&& head, Tail&&... tail){cerr << head;if(sizeof...(tail)) cerr << " ";ERR(move(tail)...);}void fsp(int n){cout << fixed << setprecision(n);}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; }const ll INF=1LL<<60;const int inf=(1<<30)-1;const int mod=998244353;// const int mod=1e9+7;int dx[8]={1,0,-1,0,-1,-1,1,1};int dy[8]={0,1,0,-1,-1,1,-1,1};// #include<atcoder/all>// using namespace atcoder;// using mint=modint998244353;// ostream &operator<<(ostream &os, const mint &p) {return os << p.val();}// istream &operator>>(istream &is, mint &a) {int64_t t;is >> t;a = mint(t);return (is);}// using mint=modint1000000007;// Dijkstratemplate <typename T>struct Edge {int to;T cost;};template <typename T>class Dijkstra {private:vector<vector<Edge<T>>> G;int num_v;public:Dijkstra(int num_v) : G(num_v), num_v(num_v) {}void add(int from, int to, T cost) {G[from].push_back((Edge<T>){to, cost});}// start: Start point// result: resultvoid solve(int start, vector<T>& result) {vector<int> tmp;solve(start, result, tmp);}void solve(int start, vector<T>& result, vector<int>& prev) {result.resize(num_v);std::fill(result.begin(), result.end(), INF);prev.resize(num_v);std::fill(prev.begin(), prev.end(), -1);// get<0>(T): cost// get<1>(T): index// get<2>(T): ... ( for extent)using Tup = tuple<T, int>;priority_queue<Tup, vector<Tup>, greater<Tup>> que;que.emplace(0, start);result[start] = 0;while (!que.empty()) {Tup p = que.top();que.pop();T t = get<0>(p);int v = get<1>(p);// queueに入れてから別の最短経路が見つかった場合、探索処理は不要if (result[v] != t) {continue;}// vの各辺に対しよりコストの低い経路があるかを確認for (auto& e : G[v]) {if (result[e.to] > result[v] + e.cost) {prev[e.to] = v;result[e.to] = result[v] + e.cost;que.emplace(result[v] + e.cost, e.to);}}}}// t: 目的地vector<int> get_path(const vector<int>& prev, int t) {vector<int> path;for (int v = t; v != -1; v = prev[v]) {path.push_back(v);}reverse(path.begin(), path.end());return path;}};int main(){cin.tie(0);ios::sync_with_stdio(false);LL(n,m,l);l--;Dijkstra<ll> dij(n);VEC(ll,t,n);REP(i,m){INT(a,b,c);a--,b--;dij.add(a,b,c);dij.add(b,a,c);}int cnt=0;REP(i,n) if(t[i]) cnt++;if(cnt==1){OUT(0);return 0;}vvc<ll> d(n,vc<ll>(n));REP(i,n){dij.solve(i,d[i]);}ll ans=INF;REP(i,n){ll res=d[l][i];REP(j,n){res+=d[i][j]*2*t[j];}chmin(ans,res);REP(j,n){if(t[j]){// ERR(j,d[l][i],d[j][i],d[l][j]);chmin(ans,res-d[l][i]-d[j][i]+d[l][j]);}}// ERR(res);// chmin(ans,res);}OUT(ans);}