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

提出ソース

結果

問題	No.1653 Squarefree
ユーザー	haruki_K
提出日時	2021-08-20 22:33:16
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	803 ms / 2,000 ms
コード長	7,579 bytes
コンパイル時間	2,508 ms
コンパイル使用メモリ	216,564 KB
実行使用メモリ	79,840 KB
最終ジャッジ日時	2024-10-14 08:21:42
合計ジャッジ時間	24,975 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	795 ms 79,768 KB
testcase_01	AC	11 ms 7,664 KB
testcase_02	AC	12 ms 7,624 KB
testcase_03	AC	11 ms 7,696 KB
testcase_04	AC	12 ms 7,636 KB
testcase_05	AC	12 ms 7,596 KB
testcase_06	AC	11 ms 7,636 KB
testcase_07	AC	11 ms 7,632 KB
testcase_08	AC	11 ms 7,800 KB
testcase_09	AC	12 ms 7,628 KB
testcase_10	AC	12 ms 7,680 KB
testcase_11	AC	773 ms 77,404 KB
testcase_12	AC	774 ms 77,396 KB
testcase_13	AC	782 ms 79,328 KB
testcase_14	AC	792 ms 79,196 KB
testcase_15	AC	792 ms 79,816 KB
testcase_16	AC	786 ms 79,492 KB
testcase_17	AC	776 ms 79,472 KB
testcase_18	AC	790 ms 79,840 KB
testcase_19	AC	791 ms 79,376 KB
testcase_20	AC	789 ms 79,824 KB
testcase_21	AC	795 ms 79,676 KB
testcase_22	AC	797 ms 79,744 KB
testcase_23	AC	786 ms 79,108 KB
testcase_24	AC	774 ms 79,308 KB
testcase_25	AC	783 ms 79,776 KB
testcase_26	AC	777 ms 79,012 KB
testcase_27	AC	778 ms 79,768 KB
testcase_28	AC	761 ms 79,188 KB
testcase_29	AC	773 ms 79,624 KB
testcase_30	AC	765 ms 79,112 KB
testcase_31	AC	803 ms 79,636 KB
testcase_32	AC	790 ms 79,800 KB
testcase_33	AC	790 ms 79,348 KB
testcase_34	AC	795 ms 79,708 KB
testcase_35	AC	782 ms 79,628 KB
testcase_36	AC	12 ms 7,688 KB
testcase_37	AC	12 ms 7,636 KB
testcase_38	AC	12 ms 7,624 KB
testcase_39	AC	12 ms 7,600 KB
testcase_40	AC	12 ms 7,740 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class T> vector<T> &operator--(vector<T> &v) { for (T &x : v) --x; return v; }
template <class T> vector<T> &operator++(vector<T> &v) { for (T &x : v) ++x; return v; }
// <<<
// >>> sieve

namespace Sieve {
    constexpr int MAX = 1e6 + 10;
    vector<int32_t> ps, pf; // primes, min prime factor
    auto sieve_init = [](){
        pf.resize(MAX+1);
        iota(pf.begin(), pf.end(), 0);
        for (int i = 2; i <= MAX; ++i) {
            if (pf[i] == i) ps.push_back(i);
            for (int p : ps) {
                const int x = p*i;
                if (p > pf[i] || x > MAX) break;
                pf[x] = p;
            }
        }
        return 0;
    }();
    bool is_prime(int n) {
        assert(0 <= n); assert(n <= MAX);
        return pf[n] == n && n >= 2;
    }
    vector<pair<int, int>> prime_factor(int n) {
        assert(0 <= n); assert(n <= MAX);
        static vector<pair<int, int>> ret;
        ret.clear();
        uint32_t m = n;
        while (m > 1u) {
            uint32_t p = pf[m], i = 0;
            do m /= p, ++i; while ((uint32_t)pf[m] == p);
            ret.emplace_back(p, i);
        }
        return ret;
    }
    vector<int> divisors(int n) {
        assert(0 <= n); assert(n <= MAX);
        static vector<int> ret;
        ret.clear();
        ret.push_back(1);
        for (auto p : prime_factor(n)) {
            int m = ret.size();
            for (int i = 0; i < m; ++i) {
                for (int j = 0, v = 1;  j < p.second; ++j) {
                    v *= p.first;
                    ret.push_back(ret[i]*v);
                }
            }
        }
        return ret;
    }
}
using namespace Sieve;

// <<<
u64 isqrt(u64 n) {
    if (n == -1ull) return u32(-1);
    u64 x = std::sqrt((double)n);
    return x*x > n ? x-1 : x;
}

bool is_sq(int x) {
    int s = isqrt(x);
    return s*s == x;
}

int32_t main() {
    int L, R; cin >> L >> R;

    int len = R-L+1;
    vector<vector<int>> pf(len);
    for (int p : ps) {
        for (int x = R-R%p; x >= L; x -= p) {
            pf[x-L].eb(p);
        }
    }
    dump(L, R, len);
    dump(pf);

    int ans = 0;
    rep (i, len) {
        int x = i+L;
        bool ok = true;
        for (int p : pf[i]) {
            int cnt = 0;
            while (x % p == 0) x /= p, cnt++;
            if (cnt >= 2) {
                ok = false;
                break;
            }
        }
        dump(i, i+L, ok, is_sq(x));
        if (ok and not (x > 1 and is_sq(x))) ans++;
    }

    cout << ans << '\n';

}

yukicoder

結果

テストケース

ソースコード