#480076 (C++14) No.62 リベリオン(Extra)

• 問題: No.62 リベリオン(Extra)
• ユーザー: maine_honzuki
• 提出日時: 2020-05-10 12:26:08
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 107 ms / 5,000 ms
• コード長: 2,428 bytes
• コンパイル時間: 1,687 ms
• コンパイル使用メモリ: 168,372 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-07 12:59:57
• 合計ジャッジ時間: 2,527 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 2
other	AC * 3

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll W, H, D, Vx, Vy;
ll gcd(ll a, ll b) {
    while (b) {
        ll c = b;
        b = a % b;
        a = c;
    }
    return a;
}
ll lcm(ll a, ll b) {
    if (!a || !b)
        return 0;
    return a * b / gcd(a, b);
}
ll extgcd(ll a, ll b, ll& x, ll& y) {
    if (b) {
        ll d = extgcd(b, a % b, y, x);
        y -= a / b * x;
        return d;
    } else {
        x = 1;
        y = 0;
        return a;
    }
}
ll rem(ll& a, ll b) {
    return ((a %= b) += b) %= b;
}
__int128 rem(__int128& a, ll b) {
    return ((a %= b) += b) %= b;
}
bool hit(ll Mx, ll My) {
    ll My_origin = My;
    ll w = 2 * W, h = 2 * H;
    ll a, b;
    ll g = extgcd(Vx, 2 * W, a, b);
    if (Mx % g)
        return false;
    rem(a, w);
    a *= Mx / g;
    rem(a, w / g);
    ll can_add_to_a = w / g;
    My -= Vy * (a % (h));
    rem(My, h);
    if (My == 0) {
        return a <= D;
    }
    ll c, d;
    g = extgcd(Vy * can_add_to_a, h, c, d);
    assert(Vy * can_add_to_a * c + h * d == g);
    c *= can_add_to_a;
    if (My % g) return false;
    rem(c, lcm(h / gcd(h, Vy), can_add_to_a));
    __int128 tmp_c = c;
    ll times_c = My / g;
    rem(times_c, lcm(h / gcd(h, Vy), can_add_to_a));
    tmp_c *= times_c;
    rem(tmp_c, lcm(h / gcd(h, Vy), can_add_to_a));
    c = tmp_c;
    return c + a <= D;
}
int main() {
    int Q;
    cin >> Q;
    while (Q--) {
        ll Mx, My, Hx, Hy;
        cin >> W >> H >> D >> Mx >> My >> Hx >> Hy >> Vx >> Vy;
        ll g = gcd(abs(Vx), abs(Vy));
        Vx /= g;
        Vy /= g;
        D *= g;
        if (Vx < 0) {
            Vx *= -1;
            Hx = W - Hx;
            Mx = W - Mx;
        }
        if (Vy < 0) {
            Vy *= -1;
            Hy = H - Hy;
            My = H - My;
        }
        Vx %= 2 * W;
        Vy %= 2 * H;
        ll mx, my;
        bool ans = false;
        for (int i = 0; i < 4; i++) {
            if (i < 2)
                mx = Mx;
            else
                mx = W * 2 - Mx;
            if (i % 2 == 0)
                my = My;
            else
                my = H * 2 - My;
            mx -= Hx;
            my -= Hy;
            if (mx < 0)
                mx += W * 2;
            if (my < 0)
                my += H * 2;
            bool flag = hit(mx, my);
            ans |= flag;
        }
        cout << (ans ? "Hit" : "Miss") << endl;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX