#564632 (C++17) No.1250 汝は倍数なりや?

提出ソース

結果

問題	No.1250 汝は倍数なりや?
ユーザー	mai
提出日時	2020-10-09 22:09:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,693 bytes
コンパイル時間	4,541 ms
コンパイル使用メモリ	223,932 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-07-20 11:45:58
合計ジャッジ時間	10,222 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	81 ms 5,248 KB
testcase_01	AC	80 ms 5,376 KB
testcase_02	AC	78 ms 5,376 KB
testcase_03	AC	78 ms 5,376 KB
testcase_04	WA	-
testcase_05	AC	79 ms 5,376 KB
testcase_06	AC	78 ms 5,376 KB
testcase_07	AC	77 ms 5,376 KB
testcase_08	AC	77 ms 5,376 KB
testcase_09	AC	79 ms 5,376 KB
testcase_10	AC	77 ms 5,376 KB
testcase_11	WA	-
testcase_12	AC	78 ms 5,376 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	77 ms 5,376 KB
testcase_16	WA	-
testcase_17	AC	77 ms 5,376 KB
testcase_18	AC	79 ms 5,376 KB
testcase_19	AC	79 ms 5,376 KB
testcase_20	AC	78 ms 5,376 KB
testcase_21	AC	78 ms 5,376 KB
testcase_22	AC	76 ms 5,376 KB
testcase_23	AC	79 ms 5,376 KB
testcase_24	AC	79 ms 5,376 KB
testcase_25	AC	78 ms 5,376 KB
testcase_26	AC	79 ms 5,376 KB
testcase_27	AC	80 ms 5,376 KB
testcase_28	WA	-
testcase_29	AC	79 ms 5,376 KB
testcase_30	WA	-
testcase_31	WA	-
testcase_32	AC	77 ms 5,376 KB
testcase_33	AC	85 ms 5,376 KB
testcase_34	AC	83 ms 5,376 KB
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	AC	81 ms 5,376 KB
testcase_39	WA	-
testcase_40	AC	81 ms 5,376 KB
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	AC	81 ms 5,376 KB
testcase_45	AC	83 ms 5,376 KB
testcase_46	WA	-
testcase_47	AC	81 ms 5,376 KB
testcase_48	AC	79 ms 5,376 KB
testcase_49	AC	81 ms 5,376 KB
testcase_50	AC	80 ms 5,376 KB
testcase_51	AC	78 ms 5,376 KB

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

ソースコード

raw source code

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

template <typename I>
struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I>
static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';
  return o << ']';
}
template <typename I>
struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I>
static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

template <int Max = 2000>
class IsPrimeC {
  bool d_[Max + 1];

  template <typename T>
  static constexpr T cesqrt(T s) {
    double x = s / 2.0;
    double prev = 0.0;
    while (x != prev) {
      prev = x;
      x = (x + s / x) / 2.0;
    }
    return x;
  }

 public:
  constexpr IsPrimeC() : d_() {
    d_[0] = d_[1] = 1;
    int sqh = cesqrt<int>(Max);
    for (int i = 2; i <= sqh; i++) {
      if (d_[i] == 0) {
        for (int j = i * i; j <= Max; j += i) {  // i*i
          d_[j] = 1;
        }
      }
    }
    for (int i = 0; i <= Max; ++i)
      d_[i] = !d_[i];
  }
  constexpr inline bool operator[](int x) const { return d_[x]; }
};

template <int Max = 2000>
class PrimeListC {
  int d_[Max];

 public:
  constexpr PrimeListC() : d_() {
    int n = 1;
    d_[0] = 2;
    for (int x = 3; n < Max; ++x) {
      bool f = true;
      for (int i = 0; d_[i] * d_[i] <= x; ++i)
        if (x / d_[i] * d_[i] == x) {
          f = false;
          break;
        }
      if (f)
        d_[n++] = x;
    }
  }
  constexpr inline int operator[](int x) const { return d_[x]; }
  template <int _Max>
  class iterator {
    const PrimeListC<_Max>& pl;
    int ptr = 0;

   public:
    constexpr iterator(const decltype(pl)& _pl, int _ptr = 0) : pl(_pl), ptr(_ptr) {}
    constexpr int operator*() const { return pl[ptr]; }
    constexpr iterator<_Max>& operator++() {
      ptr++;
      return *this;
    }  // prefix
    constexpr inline bool operator!=(const iterator<_Max>& it) const {
      return ptr != it.ptr ? !(_Max < ptr && _Max < it.ptr) : false;
    }
    constexpr inline bool operator==(const iterator<_Max>& it) const {
      return ptr != it.ptr ? (_Max < ptr && _Max < it.ptr) : true;
    }
  };
  constexpr PrimeListC::iterator<Max> begin() const { return PrimeListC::iterator<Max>(*this, 0); }
  constexpr PrimeListC::iterator<Max> end() const { return PrimeListC::iterator<Max>(*this, Max); }

  std::map<long long, int> division(long long number) const {
    std::map<long long, int> div;
    for (int i = 0; number > 1 && i < Max; ++i) {
      long long p = d_[i];
      int c = 0;
      while (number / p * p == number)
        ++c, number /= p;
      if (c > 0)
        div[p] = c;
    }
    return div;
  }
};

//



//


PrimeListC<100010> prime;

int main() {
  ll N, H;
  scanner >> N >> H;
  
  if (H == 1) bye("YES");
  
  auto mh = prime.division(H);
  int sgn = 1;
  repeat(i, N) {
    ll a; scanner >> a;
    if (a < 0) sgn *= -1;
    a = abs(a);
    if (a == 0) bye("YES");
    for (auto& p : mh) {
      if (p.second <= 0) continue;
      int d = p.first;
      if (d == 1) break;  // bug?
      while (a % d == 0) {
        p.second -= 1;
        a /= d;
      }
    }
  }
  
  if (sgn > 0 && all_of(all(mh), [](pair<long long, int> p){ return p.second <= 0;})) {
    cout <<"YES" <<endl;
  } else {
    cout << "NO" << endl;
  }
  
  return 0;
}

yukicoder

結果

テストケース

ソースコード