結果
問題 | No.1653 Squarefree |
ユーザー | satashun |
提出日時 | 2021-08-26 22:47:17 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 128 ms / 2,000 ms |
コード長 | 3,276 bytes |
コンパイル時間 | 1,948 ms |
コンパイル使用メモリ | 207,248 KB |
実行使用メモリ | 20,336 KB |
最終ジャッジ日時 | 2024-11-18 21:15:51 |
合計ジャッジ時間 | 6,634 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 128 ms
20,296 KB |
testcase_01 | AC | 13 ms
8,704 KB |
testcase_02 | AC | 12 ms
8,704 KB |
testcase_03 | AC | 13 ms
8,704 KB |
testcase_04 | AC | 13 ms
8,704 KB |
testcase_05 | AC | 13 ms
8,696 KB |
testcase_06 | AC | 12 ms
8,704 KB |
testcase_07 | AC | 13 ms
8,704 KB |
testcase_08 | AC | 12 ms
8,576 KB |
testcase_09 | AC | 11 ms
8,704 KB |
testcase_10 | AC | 12 ms
8,704 KB |
testcase_11 | AC | 117 ms
20,208 KB |
testcase_12 | AC | 119 ms
20,164 KB |
testcase_13 | AC | 122 ms
20,208 KB |
testcase_14 | AC | 125 ms
20,080 KB |
testcase_15 | AC | 126 ms
20,128 KB |
testcase_16 | AC | 119 ms
20,336 KB |
testcase_17 | AC | 118 ms
20,188 KB |
testcase_18 | AC | 119 ms
20,212 KB |
testcase_19 | AC | 124 ms
20,196 KB |
testcase_20 | AC | 125 ms
20,268 KB |
testcase_21 | AC | 122 ms
20,080 KB |
testcase_22 | AC | 124 ms
20,212 KB |
testcase_23 | AC | 117 ms
20,132 KB |
testcase_24 | AC | 122 ms
20,200 KB |
testcase_25 | AC | 123 ms
20,336 KB |
testcase_26 | AC | 120 ms
20,256 KB |
testcase_27 | AC | 122 ms
20,204 KB |
testcase_28 | AC | 119 ms
20,128 KB |
testcase_29 | AC | 118 ms
20,324 KB |
testcase_30 | AC | 120 ms
20,128 KB |
testcase_31 | AC | 118 ms
20,204 KB |
testcase_32 | AC | 121 ms
20,208 KB |
testcase_33 | AC | 121 ms
20,160 KB |
testcase_34 | AC | 123 ms
20,212 KB |
testcase_35 | AC | 123 ms
20,196 KB |
testcase_36 | AC | 13 ms
8,696 KB |
testcase_37 | AC | 14 ms
8,636 KB |
testcase_38 | AC | 13 ms
8,704 KB |
testcase_39 | AC | 13 ms
8,576 KB |
testcase_40 | AC | 13 ms
8,704 KB |
ソースコード
//#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; template <class T> V<T> make_vec(size_t a) { return V<T>(a); } template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) { return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...)); } #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; } template <class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; } template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif // https://cp-algorithms.com/algebra/prime-sieve-linear.html const int maxv = 1000010; // lowest prime factor int lp[maxv]; bool pri[maxv]; vector<int> pr; void linear_sieve() { for (int i = 2; i < maxv; ++i) pri[i] = true; for (int i = 2; i < maxv; ++i) { if (pri[i]) { lp[i] = i; pr.pb(i); } for (int j = 0; j < (int)pr.size() && pr[j] <= lp[i] && i * pr[j] < maxv; ++j) { pri[i * pr[j]] = false; lp[i * pr[j]] = pr[j]; if (i % pr[j] == 0) break; } } } constexpr ll floor_sqrt(ll n) { if (n == 0) return 0; return llround(floor(sqrt(n))); } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll L, R; cin >> L >> R; linear_sieve(); V<ll> f(R - L + 1); V<int> ng(R - L + 1); for (ll i = L; i <= R; ++i) { f[i - L] = i; } for (auto p : pr) { ll l = (L + p - 1) / p * p; for (ll i = l; i <= R; i += p) { ll& x = f[i - L]; x /= p; while (x % p == 0) { x /= p; ng[i - L] = 1; } } } int ans = 0; for (ll i = L; i <= R; ++i) { if (ng[i - L]) continue; ll x = floor_sqrt(f[i - L]); if (x == 1 || x * x != f[i - L]) { // debug(i); ans++; } } cout << ans << endl; return 0; }