結果

問題 No.859 路線A、路線B、路線C
ユーザー yakamoto
提出日時 2019-08-09 21:54:40
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 3,020 bytes
コンパイル時間 1,316 ms
コンパイル使用メモリ 166,332 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-19 11:46:49
合計ジャッジ時間 1,893 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */
#include <iostream>
#include <fstream>
#ifndef SOLUTION_COMMON_H
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PI = pair<int, int>;
template<class T> using V = vector<T>;
using VI = V<int>;
#define _1 first
#define _2 second
#ifdef MY_DEBUG
# define DEBUG(x) x
#else
# define DEBUG(x)
#endif
template<class T>
inline void debug(T &A) {
  DEBUG(
      for (const auto &a : A) {
        cerr << a << " ";
      }
      cerr << '\n';
  )
}
template<class T, class Func>
inline void debug_with_format(T &A, Func f) {
  DEBUG(
      for (const auto &a : A) {
        cerr << f(a) << " ";
      }
      cerr << '\n';
  )
}
template<class T>
inline void debug_dim2(T &A) {
  DEBUG(
      for (const auto &as : A) {
        debug(as);
      }
  )
}
template<typename ... Args>
inline void debug(const char *format, Args const &... args) {
  DEBUG(
      fprintf(stderr, format, args ...);
      cerr << '\n';
  )
}
template<typename ... Args>
string format(const string &fmt, Args ... args) {
  size_t len = snprintf(nullptr, 0, fmt.c_str(), args ...);
  vector<char> buf(len + 1);
  snprintf(&buf[0], len + 1, fmt.c_str(), args ...);
  return string(&buf[0], &buf[0] + len);
}
template<class T1, class T2>
string fmtP(pair<T1, T2> a) {
  stringstream ss;
  ss << "(" << a._1 << "," << a._2 << ")";
  return ss.str();
}
#define SOLUTION_COMMON_H
#endif //SOLUTION_COMMON_H
const int MOD = 1000000007;
class C {
public:
  void solve(std::istream& in, std::ostream& out) {
    ll A, B, C;
    in >> A >> B >> C;
    char s0, s1;
    ll t0, t1;
    in >> s0 >> t0 >> s1 >> t1;
    auto calc0 = [&](ll t0, ll t1, ll me, ll other) {
      ll a1 = min(t0, t1) - 1;
      ll an = me - max(t0, t1);
      return min(abs(t1 - t0), a1 + an + other + 1);
    };
    auto calc1 = [&](ll t0, ll t1, ll me0, ll me1, ll other) {
      ll a1 = t0 - 1;
      ll an = me0 - t0;
      ll c1 = t1 - 1;
      ll cn = me1 - t1;
      ll rt1 = a1 + c1 + 1;
      ll rt2 = an + cn + 1;
      ll rt3 = a1 + other + cn + 1;
      ll rt4 = an + other + c1 + 1;
      return min(min(rt1, rt2), min(rt3, rt4));
    };
    auto calcAll = [&](int t0, int t1) {
      if (s0 == s1) {
        if (s0 == 'A') {
          return calc0(t0, t1, A, min(B, C));
        } else if (s0 == 'B') {
          return calc0(t0, t1, B, min(A, C));
        } else {
          return calc0(t0, t1, C, min(A, B));
        }
      } else {
        if (s0 > s1) {
          swap(s0, s1);
          swap(t0, t1);
        }
        if (s0 == 'A' && s1 == 'B') {
          return calc1(t0, t1, A, B, C);
        } else if (s0 == 'A' && s1 == 'C') {
          return calc1(t0, t1, A, C, B);
        } else {
          return calc1(t0, t1, B, C, A);
        }
      }
    };
    out << calcAll(t0, t1);
  }
};
int main() {
    C solver;
    std::istream& in(std::cin);
    std::ostream& out(std::cout);
    solver.solve(in, out);
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0