結果

問題 No.61 リベリオン
ユーザー fumiphysfumiphys
提出日時 2019-08-24 17:53:12
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 30 ms / 5,000 ms
コード長 4,868 bytes
コンパイル時間 1,646 ms
コンパイル使用メモリ 165,032 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-04-21 17:21:30
合計ジャッジ時間 2,213 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

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

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#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 vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

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>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
int w, h, mx, my, hx, hy, vx, vy;
ll d;
bool vis[16][16][9];
// 012
// 345
// 678

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);
}


int dir(int i, int j){
  int res = 0;
  if(i > 0){
    res += 2;
  }else if(i == 0)++res;
  if(j == 0)res += 3;
  else if(j < 0)res += 6;

  return res;
}

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)...);
}


bool dfs(int x, int y, int di, ll rem){
  if(x == mx && y == my && rem >= 0)return true;
  if(rem < 0)return false;
  // excerr("#1:", x, y, di, rem);
  vis[x][y][di] = true;
  int vvx = abs(vx), vvy = abs(vy);
  if(di % 3 == 1)vvx = 0;
  if(di % 3 == 0)vvx *= -1;
  if(di >= 6)vvy *= -1;
  else if(di >= 3)vvy = 0;
  int nx = x + vvx, ny = y + vvy;
  while(nx < 0 || nx > w){
    if(nx < 0)nx = - nx, vvx *= -1;
    else if(nx > w)nx = w - (nx - w), vvx *= -1;
  }
  while(ny < 0 || ny > h){
    if(ny < 0)ny = - ny, vvy *= -1;
    else if(ny > h)ny = h - (ny - h), vvy *= -1;
  }
  di = dir(vvx, vvy);
  if(vis[nx][ny][di])return false;
  // excerr("#2:", nx, ny, di, rem - 1);
  return dfs(nx, ny, di, rem - 1);
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(q);
  rep(i_, q){
    cin >> w >> h >> d >> mx >> my >> hx >> hy >> vx >> vy;
    int vxy = gcd(abs(vx), abs(vy));
    vx /= vxy, vy /= vxy;
    d *= vxy;
    rep(i, w + 1)rep(j, h + 1)rep(k, 9)vis[i][j][k] = false;
    bool b = dfs(hx, hy, dir(vx, vy), d);
    if(b)cout << "Hit" << endl;
    else cout << "Miss" << endl;
  }
  return 0;
}
0