#691566 (C++17) No.1653 Squarefree

提出ソース

結果

問題	No.1653 Squarefree
ユーザー	stoq
提出日時	2021-08-20 23:48:48
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	648 ms / 2,000 ms
コード長	4,868 bytes
コンパイル時間	4,825 ms
コンパイル使用メモリ	268,992 KB
実行使用メモリ	20,960 KB
最終ジャッジ日時	2024-10-14 08:43:00
合計ジャッジ時間	22,600 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	620 ms 20,880 KB
testcase_01	AC	37 ms 9,088 KB
testcase_02	AC	37 ms 9,216 KB
testcase_03	AC	37 ms 9,088 KB
testcase_04	AC	36 ms 9,088 KB
testcase_05	AC	37 ms 9,216 KB
testcase_06	AC	36 ms 9,088 KB
testcase_07	AC	37 ms 8,960 KB
testcase_08	AC	37 ms 9,088 KB
testcase_09	AC	37 ms 9,088 KB
testcase_10	AC	38 ms 9,088 KB
testcase_11	AC	510 ms 20,784 KB
testcase_12	AC	534 ms 20,864 KB
testcase_13	AC	591 ms 20,736 KB
testcase_14	AC	634 ms 20,736 KB
testcase_15	AC	629 ms 20,864 KB
testcase_16	AC	636 ms 20,736 KB
testcase_17	AC	601 ms 20,808 KB
testcase_18	AC	613 ms 20,912 KB
testcase_19	AC	637 ms 20,720 KB
testcase_20	AC	648 ms 20,864 KB
testcase_21	AC	603 ms 20,772 KB
testcase_22	AC	647 ms 20,816 KB
testcase_23	AC	585 ms 20,736 KB
testcase_24	AC	613 ms 20,804 KB
testcase_25	AC	607 ms 20,960 KB
testcase_26	AC	638 ms 20,820 KB
testcase_27	AC	622 ms 20,736 KB
testcase_28	AC	579 ms 20,736 KB
testcase_29	AC	600 ms 20,608 KB
testcase_30	AC	598 ms 20,668 KB
testcase_31	AC	591 ms 20,736 KB
testcase_32	AC	615 ms 20,788 KB
testcase_33	AC	597 ms 20,716 KB
testcase_34	AC	633 ms 20,824 KB
testcase_35	AC	590 ms 20,736 KB
testcase_36	AC	37 ms 9,088 KB
testcase_37	AC	37 ms 9,216 KB
testcase_38	AC	37 ms 9,088 KB
testcase_39	AC	37 ms 9,088 KB
testcase_40	AC	37 ms 9,216 KB

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

ソースコード

raw source code

#define MOD_TYPE 1

#pragma region Macros

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

#include <atcoder/all>
using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(500010);

#pragma endregion

ll sqrti(ll n) {
  assert(n >= 0);
  ll lo = 0, hi = 1e9 + 10;
  while (hi - lo > 1) {
    ll mi = (lo + hi) / 2;
    if (mi * mi <= n)
      lo = mi;
    else
      hi = mi;
  }
  return lo;
}

void solve() {
  ll l, r;
  cin >> l >> r;
  vector<int> v(r - l + 1, 1);
  vector<ll> a(r - l + 1);
  rep(i, r - l + 1) a[i] = l + i;
  for (ll p = 2; p <= 1000000; p++) {
    for (ll i = CEIL(l, p) * p; i <= r / p * p; i += p) {
      int c = 0;
      while (a[i - l] % p == 0) a[i - l] /= p, c++;
      if (c >= 2) v[i - l] = 0;
    }
  }
  rep(i, r - l + 1) {
    if (v[i] == 0) continue;
    ll sq = sqrti(a[i]);
    if (sq > 1 and sq * sq == a[i]) v[i] = 0;
  }
  cout << accumulate(all(v), 0) << "\n";
}

int main() { solve(); }

yukicoder

結果

テストケース

ソースコード