#757526 (C++17) No.62 リベリオン(Extra)

提出ソース

結果

問題	No.62 リベリオン(Extra)
ユーザー	Demystify
提出日時	2022-05-01 03:28:34
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,271 bytes
コンパイル時間	2,143 ms
コンパイル使用メモリ	204,552 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-09-12 18:24:39
合計ジャッジ時間	3,072 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,384 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	11 ms 4,380 KB
testcase_03	AC	11 ms 4,380 KB
testcase_04	WA	-

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (int i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define P0(i) (((i) & 1) == 0)
#define P1(i) (((i) & 1) == 1)
#ifdef _LOCAL
    #define debug_bar cerr << "--------------------\n";
    #define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
    #define debug_pair(x) cerr << "l." << __LINE__ << " : " << #x << " = (" << x.first << "," << x.second << ")\n";
    template<class T> void debug_line(const vector<T>& ans, int l, int r, int L = 0) { cerr << "l." << L << " :"; for (int i = l; i < r; i++) { cerr << ' ' << ans[i]; } cerr << '\n'; }
#else
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(x)
    #define debug_pair(x)
    template<class T> void debug_line([[maybe_unused]] const vector<T>& ans, [[maybe_unused]] int l, [[maybe_unused]] int r, [[maybe_unused]] int L = 0) {}
#endif
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
pair<ll,ll> divmod(ll a, ll b) { assert(a >= 0 && b > 0); return make_pair(a / b, a % b); }
ll mod(ll x, ll m) { assert(m != 0); return (x % m + m) % m; }
ll llceil(ll a, ll b) { if (b < 0) { return llceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
ll llfloor(ll a, ll b) { if (b < 0) { return llfloor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
ll llpow(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = llpow(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digit_len(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll digit_sum(ll n) { assert(n >= 0); ll sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; }
ll digit_prod(ll n) { assert(n >= 0); if (n == 0) { return 0; } ll prod = 1; while (n > 0) { prod *= n % 10; n /= 10; } return prod; }
ll xor_sum(ll x) { assert(0 <= x); switch (x % 4) { case 0: return x; case 1: return 1; case 2: return x ^ 1; case 3: return 0; } assert(false); }
string toupper(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = toupper(T[i]); } return T; }
string tolower(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = tolower(T[i]); } return T; }
int a2i(const char& c) { assert(islower(c)); return (c - 'a'); }
int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); }
int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); }
char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); }
char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); }
char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
const ld EPS = 1e-10;
const ld PI  = acosl(-1.0);
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr int inf = (1 << 30) - 1;   // 1073741824 - 1
constexpr ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;


// References:
//   <https://cp-algorithms.com/algebra/linear-diophantine-equation.html>

// 拡張ユークリッドの互除法 : O(log (a + b))
//   - ベズーの等式: ax + by = gcd(a, b) の整数解 (x_g, y_g) を一つ求めて gcd(a, b) を返す
//   - gcd(a, b) < 0 の場合、gcd(a, b) と (x_g, y_g) の符号を反転する
ll extgcd(ll a, ll b, ll& x, ll& y) {
    auto _extgcd = [](auto&& self, ll a, ll b, ll& x, ll& y) -> ll {
        if (b == 0) { x = 1; y = 0; return a; }
        ll g = self(self, b, a % b, y, x);
        y -= (a / b) * x;
        return g;
    };
    ll g = _extgcd(_extgcd, a, b, x, y);
    if (g < 0) { g = -g; x = -x; y = -y; }
    return g;
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int Q; input(Q);
    while (Q--) {
        ll W, H, D, Mx, My, Hx, Hy, Vx, Vy; input(W, H, D, Mx, My, Hx, Hy, Vx, Vy);

        if (Vx < 0) {
            Vx = -Vx;
            Hx = W - Hx;
            Mx = W - Mx;
        }
        if (Vy < 0) {
            Vy = -Vy;
            Hy = H - Hy;
            My = H - My;
        }

        bool ok = false;
        ll a = +2*W*Vy;
        ll b = -2*H*Vx;
        for (auto mx : {Mx, 2*W - Mx}) {
            for (auto my : {My, 2*H - My}) {
                ll c = Vx*(my-Hy) - Vy*(mx-Hx);
                ll x, y;
                if (a == 0) {
                    if (c % b) continue;
                    x = 0;
                    y = c / b;
                } else if (b == 0) {
                    if (c % a) continue;
                    x = c / a;
                    y = 0;
                } else {
                    ll x_g, y_g;
                    ll g = extgcd(a, b, x_g, y_g);
                    if (c % g) continue;
                    ll x_0 = x_g * (c / g);
                    ll y_0 = y_g * (c / g);

                    ll kx = llfloor(+Hx - mx - 2*W*x_0, b / g * 2*W);
                    ll ky = llfloor(-Hy + my + 2*H*y_0, a / g * 2*H);
                    ll k = min(kx, ky);
                    x = x_0 + k * (b / g);
                    y = y_0 - k * (a / g);
                }

                ll X = mx + 2*W*x;
                ll Y = my + 2*H*y;
                if (not (Hx <= X && X <= Hx + Vx * D)) continue;
                if (not (Hy <= Y && Y <= Hy + Vy * D)) continue;
                ok = true;
            }
        }
        string ans = (ok ? "Hit" : "Miss");
        print(ans);
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード