Submission #48543993

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    std::string s;
    std::string t;
    is >> s >> t;

    Num s1 = s.at(0) - 'A';
    Num s2 = s.at(1) - 'A';
    Num t1 = t.at(0) - 'A';
    Num t2 = t.at(1) - 'A';

    const Vec rems {0, 1, 2, 2, 1};
    Num ds = std::abs(s1 - s2) % 5;
    Num dt = std::abs(t1 - t2) % 5;
    if (rems.at(ds) == rems.at(dt)) {
        os << "Yes\n";
    } else {
        os << "No\n";
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result