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

提出ソース

結果

問題	No.1653 Squarefree
ユーザー	packer_jp
提出日時	2021-08-20 23:13:10
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	377 ms / 2,000 ms
コード長	4,613 bytes
コンパイル時間	2,222 ms
コンパイル使用メモリ	202,404 KB
実行使用メモリ	11,024 KB
最終ジャッジ日時	2023-08-04 11:47:37
合計ジャッジ時間	14,467 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	376 ms 10,760 KB
testcase_01	AC	45 ms 4,376 KB
testcase_02	AC	44 ms 4,376 KB
testcase_03	AC	45 ms 4,376 KB
testcase_04	AC	45 ms 4,376 KB
testcase_05	AC	45 ms 4,376 KB
testcase_06	AC	44 ms 4,380 KB
testcase_07	AC	45 ms 4,380 KB
testcase_08	AC	43 ms 4,376 KB
testcase_09	AC	44 ms 4,380 KB
testcase_10	AC	44 ms 4,380 KB
testcase_11	AC	364 ms 10,860 KB
testcase_12	AC	365 ms 10,720 KB
testcase_13	AC	373 ms 10,816 KB
testcase_14	AC	372 ms 10,760 KB
testcase_15	AC	375 ms 10,872 KB
testcase_16	AC	375 ms 10,828 KB
testcase_17	AC	375 ms 10,708 KB
testcase_18	AC	377 ms 10,764 KB
testcase_19	AC	373 ms 10,788 KB
testcase_20	AC	377 ms 10,860 KB
testcase_21	AC	375 ms 10,716 KB
testcase_22	AC	374 ms 10,952 KB
testcase_23	AC	371 ms 10,764 KB
testcase_24	AC	373 ms 10,828 KB
testcase_25	AC	374 ms 10,816 KB
testcase_26	AC	373 ms 10,896 KB
testcase_27	AC	372 ms 10,792 KB
testcase_28	AC	371 ms 10,712 KB
testcase_29	AC	374 ms 11,024 KB
testcase_30	AC	371 ms 10,708 KB
testcase_31	AC	374 ms 10,808 KB
testcase_32	AC	376 ms 10,776 KB
testcase_33	AC	373 ms 11,008 KB
testcase_34	AC	375 ms 10,720 KB
testcase_35	AC	375 ms 10,728 KB
testcase_36	AC	44 ms 4,376 KB
testcase_37	AC	44 ms 4,376 KB
testcase_38	AC	45 ms 4,376 KB
testcase_39	AC	45 ms 4,380 KB
testcase_40	AC	44 ms 4,376 KB

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

ソースコード

raw source code

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

#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
ull bit(int n) { return 1ull << n; }
template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr ll DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr ll DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
ll sign(ll a) { return (a > 0) - (a < 0); }
ll cdiv(ll a, ll b) { return (a - 1 + b) / b; }
template <typename T> T sq(const T &a) { return a * a; }
template <typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
    os << "(" << a.first << ", " << a.second << ")";
    return os;
}
template <typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {
    auto [t, u, v] = a;
    os << "(" << t << ", " << u << ", " << v << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << "}";
    return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << "}";
    return os;
}
struct setup {
    static constexpr ll PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

#ifdef ONLINE_JUDGE
#define dump(...) (void(0))
#else
void debug() { cerr << endl; }
template <typename Head, typename... Tail> void debug(Head &&head, Tail &&... tail) {
    cerr << head;
    if (sizeof...(Tail)) cerr << ", ";
    debug(tail...);
}
#define dump(...) cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ", debug(__VA_ARGS__)
#endif

struct rep {
    struct itr {
        int v;
        itr(int v) : v(v) {}
        void operator++() { ++v; }
        int operator*() const { return v; }
        bool operator!=(const itr &i) const { return v != i.v; }
    };
    int l, r;
    rep(int r) : l(0), r(r) {}
    rep(int l, int r) : l(l), r(r) {}
    itr begin() const { return l; };
    itr end() const { return r; };
};
struct per {
    struct itr {
        int v;
        itr(int v) : v(v) {}
        void operator++() { --v; }
        int operator*() const { return v; }
        bool operator!=(const itr &i) const { return v != i.v; }
    };
    int l, r;
    per(int r) : l(0), r(r) {}
    per(int l, int r) : l(l), r(r) {}
    itr begin() const { return r - 1; };
    itr end() const { return l - 1; };
};
template <typename F> long long discrete_binary_search(long long ok, long long ng, F is_ok) {
    while (abs(ok - ng) > 1) {
        long long mid = (ok + ng) / 2;
        (is_ok(mid) ? ok : ng) = mid;
    }
    return ok;
}
int main() {
    ll l, r;
    cin >> l >> r;
    vll ng(r - l + 1);
    auto start = [&](ll x) -> ll { return l + (x - l % x) % x; };
    for (ll i : rep(1, 1e6 + 1)) {
        for (ll j = start(i); j <= r; j += i) {
            ll y = j / i;
            ll rt = sqrt(y) - 2;
            for (ll k : rep(5)) {
                if (rt > 1 && rt * rt == y) ng[j - l] = 1;
                rt++;
            }
        }
    }
    for (ll i : rep(2, 1e6 + 1)) {
        for (ll j = start(i * i); j <= r; j += i * i) { ng[j - l] = 1; }
    }
    cout << r - l + 1 - accumulate(all(ng), 0ll) << endl;
}

yukicoder

結果

テストケース

ソースコード