#934260 (C++17) No.2564 衝突予測

提出ソース

結果

問題	No.2564 衝突予測
ユーザー	あべし
提出日時	2023-12-02 15:05:28
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	78 ms / 2,000 ms
コード長	6,749 bytes
コンパイル時間	3,663 ms
コンパイル使用メモリ	212,196 KB
実行使用メモリ	6,676 KB
最終ジャッジ日時	2023-12-02 15:05:35
合計ジャッジ時間	5,246 ms
ジャッジサーバーID （参考情報）	judge13 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	62 ms 6,676 KB
testcase_04	AC	63 ms 6,676 KB
testcase_05	AC	62 ms 6,676 KB
testcase_06	AC	62 ms 6,676 KB
testcase_07	AC	61 ms 6,676 KB
testcase_08	AC	64 ms 6,676 KB
testcase_09	AC	78 ms 6,676 KB
testcase_10	AC	61 ms 6,676 KB
testcase_11	AC	60 ms 6,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
using namespace std;

// macro
#define rep(i, N) for(ll i = 0; i < (ll)(N); ++i)
#define per(i, N) for(ll i = (ll)(N) - 1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define bit(n, k) (((n) >> (k)) & 1)
#define pcnt(n) (bitset<64>(n).count())
#define endl '\n'
#define fi first
#define se second
#define mkpr make_pair
#define mktpl make_tuple
#define eb emplace_back

// input/output
template<class T> istream& operator>>(istream& is, vector<T>& V){
    for(auto& it : V) is >> it;
    return is;
}
template<class T> ostream& operator<<(ostream& os, vector<T>& V){
    for(int i = 0; i < (int)V.size(); i++){
        os << V[i];
        os << (i + 1 != (int)V.size() ? " " : "");
    }
    return os;
}
template<class T1, class T2> istream& operator>>(istream& is, pair<T1, T2>& P){
    is >> P.first >> P.second;
    return is;
}
template<class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> P){
    os << P.first << " " << P.second << "";
    return os;
}

// setup
void set_fast_ios(size_t precision){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(precision);
    cerr << fixed << setprecision(precision);
}

// make_vector
template <class T>
vector<T> make_vector(size_t a, T b) {
    return vector<T>(a, b);
}
template <class... Ts>
auto make_vector(size_t a, Ts... ts) {
    return vector<decltype(make_vector(ts...))>(a, make_vector(ts...));
}

// debug
#ifdef LOCAL
#define debug(x) cerr << "line"<< __LINE__ << ": " << #x << " = " << x << '\n'
#define debugln() cerr << "line" << __LINE__ << ": passed.\n"
#else
#define debug(x, ...) void(0)
#define debugln() void(0)
#endif

// type
using ll = long long;
using ull = unsigned long long;
using ld = double;
using i128 = __int128_t;
using State = string::iterator;
using Pair = pair<ll, ll>;
using Tuple = tuple<ll, ll, ll>;
template<class T> using max_heap = priority_queue<T>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vec<vec<T>>;
template<class T> using vvvec = vec<vvec<T>>;

// constant
constexpr ll INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr ll MOD998 = 998244353;
constexpr ll MOD107 = (ll)(1e9+7);
constexpr ll NIL = -1;
constexpr ll pm[2] = {1, -1};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
constexpr ll dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};

// function
ll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);}
ll Lcm(ll a, ll b){ return a / Gcd(a, b) * b;}
template<class T> T powi(T x, ll exp){
    return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x;
}
ll modpow(ll x, ll exp, ll mod){
    x %= mod;
    return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;
}
template<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}
template<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}

// modint
template <int mod> struct modint{
    long long x;
    modint() : x(0) {}
    modint(long long _x){ x = _x % mod; if(x < 0) x += mod; }
    constexpr modint operator-() const { return modint(-x); }
    constexpr modint& operator+=(const modint& a){ if ((x += a.x) >= mod) x -= mod; return *this; }
    constexpr modint& operator-=(const modint& a){ if ((x += mod - a.x) >= mod) x -= mod; return *this; }
    constexpr modint& operator*=(const  modint& a){ (x *= a.x) %= mod; return *this; }
    constexpr modint& operator/=(const modint& a){ return (*this) *= a.mpow(mod-2); }
    constexpr modint operator+(const modint& a) const { return modint(*this) += a; }
    constexpr modint operator-(const modint& a) const { return modint(*this) -= a; }
    constexpr modint operator*(const modint& a) const { return modint(*this) *= a; }
    constexpr modint operator/(const modint& a) const { return modint(*this) /= a; }
    constexpr bool operator==(const modint& a) const { return (*this).x == a.x; }
    constexpr bool operator!=(const modint& a) const { return (*this).x != a.x; }
    constexpr const modint mpow(long long exp) const {
        modint res(1), x = *this;
        for(; exp; exp >>= 1){
            if(exp & 1) res *= x;
            x *= x;
        }
        return res;
    }
    friend istream& operator>>(istream& is, modint& m){ is >> m.x; m = modint<mod>(m.x); return is; }
    friend ostream& operator<<(ostream& os, const modint& m){ os << m.x; return os; }
    bool operator<(const modint& a) const { return (*this).x < a.x; }
};
constexpr ll MOD = MOD998;
using mint = modint<MOD>;

template<class T> class UnionFind{
    vector<int> par, rank;
    vector<T> dat;

    void merge(int p, int u){
        dat[p] += dat[u];
    }

    public:
    UnionFind() = default;

    UnionFind(int N) : par(N), rank(N, 0), dat(N, 1) {
        for(int i = 0; i < N; i++) par[i] = i;
    }

    UnionFind(int N, vector<T>& V) : par(N), rank(N, 0), dat(N) {
        for(int i = 0; i < N; i++) par[i] = i;
        for(int i = 0; i < N; i++) dat[i] = V[i];
    }

    void unite(int x, int y){
        x = find(x), y = find(y);
        if(x == y) return;
        if(rank[y] <= rank[x]){
            if(rank[x] == rank[y]) rank[x]++;
            swap(x, y);
        }
        par[x] = y;
        merge(y, x);
    }

    int find(int x){
        if(par[x] == x) return x;
        else{
            dat[x] = dat[par[x] = find(par[x])];
            return par[x];
        }
    }

    const T &operator[](int x){
        return dat[find(x)];
    }

    bool same(int x, int y){
        return find(x) == find(y);
    }
};

int main(){
    set_fast_ios(15);

    map<char, int> mp;
    mp['R'] = 0;
    mp['U'] = 1;
    mp['L'] = 2;
    mp['D'] = 3;
    const string u = "RULD";

    auto rot90 = [&](int& x, int& y, int& d){
        int tmpx = x, tmpy = y;
        x = -tmpy;
        y = tmpx;
        d = (d + 1) % 4;
    };

    int T; cin >> T;
    while(T--){
        int x0, y0, x1, y1;
        char c0, c1;

        cin >> x0 >> y0 >> c0;
        cin >> x1 >> y1 >> c1;
        int d0 = mp[c0];
        int d1 = mp[c1];

        x1 -= x0, y1 -= y0;
        x0 = y0 = 0;
        while(d0 != 0){
            rot90(x0, y0, d0);
            rot90(x1, y1, d1);
        }
        debug(x0 << " " << y0 << " " << d0);
        debug(x1 << " " << y1 << " " << d1);

        // RULD
        bool ans = 0;
        if(d1 == 2 && x1 > 0 && y1 == 0) ans = 1; // L
        if(d1 == 1 && x1 > 0 && y1 < 0 && abs(x1) == abs(y1)) ans = 1; // U
        if(d1 == 3 && x1 > 0 && y1 > 0 && abs(x1) == abs(y1)) ans = 1; // D

        cout << (ans ? "Yes" : "No") << endl;
    }
}

yukicoder

結果

テストケース

ソースコード