結果

問題 No.1653 Squarefree
ユーザー scol_kpscol_kp
提出日時 2021-08-21 14:50:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 776 ms / 2,000 ms
コード長 4,385 bytes
コンパイル時間 2,147 ms
コンパイル使用メモリ 205,820 KB
実行使用メモリ 15,652 KB
最終ジャッジ日時 2024-10-15 05:52:45
合計ジャッジ時間 22,827 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 751 ms
15,580 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 257 ms
11,264 KB
testcase_12 AC 256 ms
11,136 KB
testcase_13 AC 766 ms
15,576 KB
testcase_14 AC 740 ms
15,392 KB
testcase_15 AC 748 ms
15,596 KB
testcase_16 AC 762 ms
15,516 KB
testcase_17 AC 754 ms
15,520 KB
testcase_18 AC 760 ms
15,628 KB
testcase_19 AC 759 ms
15,632 KB
testcase_20 AC 776 ms
15,524 KB
testcase_21 AC 762 ms
15,652 KB
testcase_22 AC 770 ms
15,652 KB
testcase_23 AC 747 ms
15,524 KB
testcase_24 AC 755 ms
15,484 KB
testcase_25 AC 753 ms
15,520 KB
testcase_26 AC 755 ms
15,400 KB
testcase_27 AC 741 ms
15,636 KB
testcase_28 AC 759 ms
15,180 KB
testcase_29 AC 758 ms
15,612 KB
testcase_30 AC 775 ms
15,400 KB
testcase_31 AC 757 ms
15,580 KB
testcase_32 AC 753 ms
15,524 KB
testcase_33 AC 738 ms
15,560 KB
testcase_34 AC 749 ms
15,572 KB
testcase_35 AC 753 ms
15,580 KB
testcase_36 AC 12 ms
7,936 KB
testcase_37 AC 11 ms
7,936 KB
testcase_38 AC 11 ms
8,024 KB
testcase_39 AC 11 ms
7,936 KB
testcase_40 AC 12 ms
7,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
template <class T>
using min_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <std::ostream& os = std::cout>
class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
#if __cplusplus >= 201703L
        auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) {
#else
        void operator()(const Args&... args) const {
#endif
            print(args...);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
#else
        void pvec(const T& vec, size_t sz) const {
#endif
            for (size_t i = 0; i < sz; i++)
                os << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
#else
        void pmat(const T& mat, size_t h, size_t w) const {
#endif
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    os << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { os << term; }
        void print_rest() const { os << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints<> prints;
Prints<std::cerr> prints_err;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

void solve() {
    ll L, R;
    cin >> L >> R;
    ++R;
    int LIM = pow(R, 1.0 / 3.0) + 1;
    std::vector<int> mpf(LIM + 1);
    std::vector<int> primes;
    for (int i = 2; i <= LIM; i++) {
        if (mpf[i] == 0) {
            mpf[i] = i;
            primes.emplace_back(i);
        }
        for (const auto& p : primes) {
            if (i * p > LIM || p > mpf[i]) break;
            mpf[i * p] = p;
        }
    }
    Vl A(R - L);
    for (ll i = 0; i < R - L; i++) {
        A[i] = L + i;
    }
    for (auto p : primes) {
        for (ll i = (p - L % p) % p; i < R - L; i += p) {
            A[i] /= p;
            if (A[i] % p == 0) A[i] = -1;
        }
    }
    ll ans = 0;
    for (ll i = 0; i < R - L; i++) {
        if (A[i] == -1) {
            continue;
        }
        if (A[i] == 1) {
            ++ans;
            continue;
        }
        ll left = 0, right = R;
        while (right - left > 1) {
            ll mid = (left + right) >> 1;
            if (mid <= A[i] / mid) {
                left = mid;
            } else {
                right = mid;
            }
        }
        if (A[i] != left * left) {
            ++ans;
        }
    }
    prints()(ans);
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}
0