結果

問題 No.859 路線A、路線B、路線C
コンテスト
ユーザー ferin
提出日時 2019-08-09 21:50:05
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,743 bytes
コンパイル時間 1,556 ms
コンパイル使用メモリ 167,844 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-19 11:36:55
合計ジャッジ時間 1,893 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 11 WA * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:75:34: warning: 'n' may be used uninitialized [-Wmaybe-uninitialized]
   75 |         if(gc!='A') chmin(ret, s + n-g + x);
      |                                ~~^~~
main.cpp:70:12: note: 'n' was declared here
   70 |         ll n;
      |            ^
main.cpp:95:24: warning: 'm' may be used uninitialized [-Wmaybe-uninitialized]
   95 |         chmin(ret, n-s + m-g + 1);
      |                    ~~~~^~~
main.cpp:84:12: note: 'm' was declared here
   84 |         ll m;
      |            ^
main.cpp:95:21: warning: 'n' may be used uninitialized [-Wmaybe-uninitialized]
   95 |         chmin(ret, n-s + m-g + 1);
      |                    ~^~
main.cpp:80:12: note: 'n' was declared here
   80 |         ll n;
      |            ^

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll x, y, z;
    cin >> x >> y >> z;
    char sc, gc;
    ll s, g;
    cin >> sc >> s >> gc >> g;

    if(sc == gc) {
        ll n;
        if(gc=='A') n = x;
        else if(gc=='B') n = y;
        else if(gc=='C') n = z;
        ll ret = abs(s-g);
        if(gc!='A') chmin(ret, s + n-g + x);
        if(gc!='B') chmin(ret, s + n-g + y);
        if(gc!='C') chmin(ret, s + n-g + z);
        cout << ret << endl;
    } else {
        ll n;
        if(sc=='A') n = x;
        else if(sc=='B') n = y;
        else if(sc=='C') n = z;
        ll m;
        if(gc=='A') m = x;
        else if(gc=='B') m = y;
        else if(gc=='C') m = z;
        ll l;
        if(sc!='A' && gc!='A') l = x;
        if(sc!='B' && gc!='B') l = y;
        if(sc!='C' && gc!='C') l = z;

        ll ret = s + g - 1;
        chmin(ret, s + l + m-g);
        chmin(ret, n-s + m-g + 1);
        chmin(ret, n-s + l + g);
        cout << ret << endl;
    }

    return 0;
}
0