結果
問題 | No.859 路線A、路線B、路線C |
ユーザー |
|
提出日時 | 2020-11-22 15:00:01 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 5,097 bytes |
コンパイル時間 | 4,658 ms |
コンパイル使用メモリ | 227,084 KB |
最終ジャッジ日時 | 2025-01-16 04:23:11 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using VI = vector<int>;using VL = vector<ll>;using VS = vector<string>;template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;#define FOR(i,a,n) for(int i=(a);i<(n);++i)#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)#define SORT(a) sort(a.begin(),a.end())#define rSORT(a) sort(a.rbegin(),a.rend())#define fSORT(a,f) sort(a.begin(),a.end(),f)#define all(a) a.begin(),a.end()#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))#define tp(a,i) get<i>(a)#ifdef _DEBUG#define line cout << "-----------------------------\n"#define stop system("pause")#endifconstexpr ll INF = 1000000000;constexpr ll LLINF = 1LL << 60;constexpr ll mod = 1000000007;constexpr ll MOD = 998244353;constexpr ld eps = 1e-10;constexpr ld pi = 3.1415926535897932;template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }template<class T>inline void print(const T& a) { cout << a << "\n"; }template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }template<class T>inline void END(T s) { print(s); exit(0); }void END() { exit(0); }int main() {init();int x, y, z; cin >> x >> y >> z;map<string, int> m;m["A1"] = 0;m["Ax"] = 1;m["B1"] = 2;m["By"] = 3;m["C1"] = 4;m["Cz"] = 5;map<string, int> xyz;xyz["A"] = x;xyz["B"] = y;xyz["C"] = z;map<string, char> ch;ch["A"] = 'x';ch["B"] = 'y';ch["C"] = 'z';vector<vector<pair<int, int>>> g(8);g[m["A1"]].emplace_back(m["Ax"], x - 1);g[m["Ax"]].emplace_back(m["A1"], x - 1);g[m["B1"]].emplace_back(m["By"], y - 1);g[m["By"]].emplace_back(m["B1"], y - 1);g[m["C1"]].emplace_back(m["Cz"], z - 1);g[m["Cz"]].emplace_back(m["C1"], z - 1);g[m["A1"]].emplace_back(m["B1"], 1);g[m["A1"]].emplace_back(m["C1"], 1);g[m["B1"]].emplace_back(m["A1"], 1);g[m["B1"]].emplace_back(m["C1"], 1);g[m["C1"]].emplace_back(m["A1"], 1);g[m["C1"]].emplace_back(m["B1"], 1);g[m["Ax"]].emplace_back(m["By"], 1);g[m["Ax"]].emplace_back(m["Cz"], 1);g[m["By"]].emplace_back(m["Ax"], 1);g[m["By"]].emplace_back(m["Cz"], 1);g[m["Cz"]].emplace_back(m["Ax"], 1);g[m["Cz"]].emplace_back(m["By"], 1);string s1; int t1; cin >> s1 >> t1;string s2; int t2; cin >> s2 >> t2;if (t1 > t2)swap(t1, t2), swap(s1, s2);if (s1 == s2) {g[m[s1 + "1"]].emplace_back(6, t1 - 1);g[6].emplace_back(m[s1 + "1"], t1 - 1);g[6].emplace_back(7, t2 - t1);g[7].emplace_back(6, t2 - t1);g[7].emplace_back(m[s1 + ch[s1]], xyz[s1] - t2);g[m[s1 + ch[s1]]].emplace_back(7, xyz[s1] - t2);}else {g[m[s1 + "1"]].emplace_back(6, t1 - 1);g[6].emplace_back(m[s1 + "1"], t1 - 1);g[6].emplace_back(m[s1 + ch[s1]], xyz[s1] - t1);g[m[s1 + ch[s1]]].emplace_back(6, xyz[s1] - t1);g[m[s2 + "1"]].emplace_back(7, t2 - 1);g[7].emplace_back(m[s2 + "1"], t2 - 1);g[7].emplace_back(m[s2 + ch[s2]], xyz[s2] - t2);g[m[s2 + ch[s2]]].emplace_back(7, xyz[s2] - t2);}VI dp(8, INF);dp[6] = 0;PQ<pair<int, int>> dik;dik.emplace(0, 6);while (!dik.empty()) {int d, cur;tie(d, cur) = dik.top();dik.pop();if (dp[cur] < d)continue;for (auto [to, cost] : g[cur]) {if (!chmin(dp[to], d + cost))continue;dik.emplace(d + cost, to);}}print(dp[7]);return 0;}