結果

問題 No.62 リベリオン(Extra)
ユーザー fumiphysfumiphys
提出日時 2020-04-19 20:50:14
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 86 ms / 5,000 ms
コード長 7,098 bytes
コンパイル時間 1,870 ms
コンパイル使用メモリ 170,336 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-04-16 00:19:43
合計ジャッジ時間 2,745 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 35 ms
5,376 KB
testcase_03 AC 34 ms
5,376 KB
testcase_04 AC 86 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

using pt = pair<P, P>;

template<typename T>
T extgcd(T a, T b, T &x, T &y){ 
  T d = a;
  if(b != 0){
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  }else{
    x = 1, y = 0;
  }
  return d;
}


template<typename T>
T gcd(T a, T b) {
  if(a > b)return gcd(b, a);
  if(a == 0)return b;
  return gcd(b % a, a);
}


template <typename T>
T modinv(T a, T m){
  long long x = 0, y = 0;
  extgcd<long long>(a, m, x, y);
  x %= m;
  if(x < 0)x += m;
  return x;
}

template <typename T>
long long garner(vector<T> b, vector<T> m, T MOD){
  m.emplace_back(MOD);
  vector<long long> coef(m.size(), 1);
  vector<long long> consts(m.size(), 0);
  for(int i = 0; i < b.size(); i++){
    long long t = ((b[i] - consts[i]) % m[i]) * modinv<long long>(coef[i], m[i]) % m[i];
    if(t < 0)t += m[i];
    for(int j = i + 1; j < m.size(); j++){
      consts[j] = (consts[j] + t * coef[j] % m[j]) % m[j];
      coef[j] = coef[j] * m[i] % m[j];
    }
  }
  return consts.back();
}

void excerr(){
  cerr << endl;
}

template <class Head, class... Tail>
void excerr(Head&& head, Tail&&... tail){
  if(sizeof...(tail) != 0)cerr << head << " ";
  else cerr << head;
  excerr(forward<Tail>(tail)...);
}


template<typename T>
pair<T, T> crt(vector<T> b, vector<T> m){
  T r = 0, M = 1;
  for(int i = 0; i < b.size(); i++){
    T x, y;
    T d = extgcd<T>(M, m[i], x, y);
    if((b[i] - r) % d != 0)return make_pair(0, -1);
    T tmp = (b[i] - r) / d * x % (m[i] / d);
    r += M * tmp;
    M *= m[i] / d;
  }
  r %= M;
  if(r < 0)r += M;
  return make_pair(r % M, M);
}



int main(int argc, char const* argv[])
{
  int q; cin >> q;
  rep(i_, q){
    ll w, h, d, mx, my, hx, hy, vx, vy;
    cin >> w >> h >> d >> mx >> my >> hx >> hy >> vx >> vy;
    ll g = gcd(abs(vx), abs(vy));
    vx /= g, vy /= g;
    d *= g;
    bool ok = false;
    ll tx[4] = {mx, mx, 2 * w - mx, 2 * w - mx};
    ll ty[4] = {my, 2 * h - my, my, 2 * h - my};
    // 
    /*
    int nx = hx, ny = hy;
    rep(i, d){
      (nx += vx) %= (2 * w);
      (ny += vy) %= (2 * h);
      if(nx < 0)nx += 2 * w;
      if(ny < 0)ny += 2 * h;
      rep(j, 4){
        if(nx == tx[j] && ny == ty[j]){
          excerr(i, j, tx[j], ty[j]);
          excerr(((i + 1) * vx + hx) % (2 * w), tx[j]);
          excerr(((i + 1) * vy + hy) % (2 * h), ty[j]);
          break;
        }
      }
    }
    */
    //
    rep(i, 4){
      ll A1 = vx, B1 = - 2 * w, C1 = tx[i] - hx;
      ll A2 = vy, B2 = - 2 * h, C2 = ty[i] - hy;
      ll g1 = gcd(abs(A1), abs(B1));
      ll g2 = gcd(abs(A2), abs(B2));
      /*
      excerr("A1:", A1, "B1:", B1, "C1:", C1);
      excerr("A2:", A2, "B2:", B2, "C2:", C2);
      */
      if(C1 % g1 != 0 || C2 % g2 != 0)continue;
      ll at1 = A1, bt1 = B1, ct1 = C1;
      ll at2 = A2, bt2 = B2, ct2 = C2;
      A1 /= g1, B1 /= g1, C1 /= g1;
      A2 /= g2, B2 /= g2, C2 /= g2;
      ll t1, c1, t2, c2;
      extgcd<ll>(A1, B1, t1, c1);
      extgcd<ll>(A2, B2, t2, c2);
      if(t1 * A1 + c1 * B1 < 0)t1 *= -1, c1 *= -1;
      if(t2 * A2 + c2 * B2 < 0)t2 *= -1, c2 *= -1;
      if(C1 != 0)t1 *= C1, c1 *= C1;
      else t1 = 0;
      if(C2 != 0)t2 *= C2, c2 *= C2;
      else t2 = 0;
      /*
      excerr("t1:", t1, "c1:", c1, "g1:", g1);
      excerr("t2:", t2, "c2:", c2, "g2:", g2);
      excerr("t1:", t1, "B1:", B1);
      excerr("t2:", t2, "B2:", B2);
      */
      if(B1 == 0){
        if(B2 == 0){
          if(t1 == t2)ok = true;
        }else{
          if((t1 - t2) % B2 == 0)ok = true;
        }
      }else{
        if(B2 == 0){
          if((t1 - t2) % B1 == 0)ok = true;
        }else{
          vector<ll> b = {t1, t2};
          vector<ll> m = {B1, B2};
          rep(j, 2){
            m[j] = abs(m[j]);
            b[j] %= m[j];
            if(b[j] < 0)b[j] += m[j];
          }
          auto p = crt<ll>(b, m);
          if(!(p.second == -1) && p.first <= d){
            /*
            cerr << b << endl;
            cerr << m << endl;
            cerr << p << " " << i << endl;
            */
            ok = true;
          }
        }
      }
    }
    cout << (ok ? "Hit": "Miss") << endl;
  }
  return 0;
}
0