結果

問題 No.859 路線A、路線B、路線C
ユーザー ningenMeningenMe
提出日時 2020-01-05 01:54:34
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 3,717 bytes
コンパイル時間 1,632 ms
コンパイル使用メモリ 171,396 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-08-14 20:57:33
合計ジャッジ時間 2,835 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 1 ms
4,376 KB
testcase_14 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> inline void chmax(T& a, const T b){a=max(a,b);}
template <class T> inline void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
	ll X,Y,Z; cin >> X >> Y >> Z;
	string S="..";
	vector<ll> t(2);
	for(int i = 0; i < 2; ++i) cin >> S[i] >> t[i];
	auto G = multivector(8,8,LOWINF);
	//0 A1
	//1 Ax
	//2 B1
	//3 By
	//4 C1
	//5 Cz
	//6 S0t0
	//7 S1t1
	G[0][1] = G[1][0] = X-1;
	G[2][3] = G[3][2] = Y-1;
	G[4][5] = G[5][4] = Z-1;
	G[0][2] = G[2][0] = 1;
	G[0][4] = G[4][0] = 1;
	G[4][2] = G[2][4] = 1;
	G[1][3] = G[3][1] = 1;
	G[3][5] = G[5][3] = 1;
	G[1][5] = G[5][1] = 1;
	for(int i = 0; i < 2; ++i){
		if(S[i]=='A') {
			G[6+i][0] = G[0][6+i] = t[i]-1;
			G[6+i][1] = G[1][6+i] = X - t[i];
		}
		if(S[i]=='B') {
			G[6+i][2] = G[2][6+i] = t[i]-1;
			G[6+i][3] = G[3][6+i] = Y - t[i];
		}
		if(S[i]=='C') {
			G[6+i][4] = G[4][6+i] = t[i]-1;
			G[6+i][5] = G[5][6+i] = Z - t[i];
		}
	}
	if(S[0]==S[1]){
		G[6][7]=G[7][6]=abs(t[0]-t[1]);
	}
	for(int k = 0; k < 8; ++k) for(int i = 0; i < 8; ++i) for(int j = 0; j < 8; ++j) chmin(G[i][j],G[i][k]+G[k][j]);
	cout << G[6][7] << endl;
	return 0;
}
0