結果
問題 | No.1514 Squared Matching |
ユーザー | keijak |
提出日時 | 2021-05-21 22:54:51 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 3,797 ms / 4,000 ms |
コード長 | 2,610 bytes |
コンパイル時間 | 1,921 ms |
コンパイル使用メモリ | 198,460 KB |
実行使用メモリ | 247,484 KB |
最終ジャッジ日時 | 2024-04-18 16:24:41 |
合計ジャッジ時間 | 56,112 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 3,659 ms
247,484 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 30 ms
6,944 KB |
testcase_07 | AC | 526 ms
49,740 KB |
testcase_08 | AC | 3,433 ms
238,492 KB |
testcase_09 | AC | 3,024 ms
208,852 KB |
testcase_10 | AC | 3,285 ms
226,004 KB |
testcase_11 | AC | 3,413 ms
235,288 KB |
testcase_12 | AC | 3,498 ms
241,796 KB |
testcase_13 | AC | 3,551 ms
245,084 KB |
testcase_14 | AC | 3,797 ms
246,236 KB |
testcase_15 | AC | 3,617 ms
246,800 KB |
testcase_16 | AC | 3,608 ms
247,188 KB |
testcase_17 | AC | 3,630 ms
247,228 KB |
testcase_18 | AC | 3,643 ms
247,296 KB |
testcase_19 | AC | 3,609 ms
247,356 KB |
testcase_20 | AC | 3,556 ms
247,288 KB |
testcase_21 | AC | 3,606 ms
247,384 KB |
testcase_22 | AC | 568 ms
51,892 KB |
testcase_23 | AC | 1,405 ms
100,808 KB |
testcase_24 | AC | 2,022 ms
149,564 KB |
testcase_25 | AC | 2,795 ms
198,576 KB |
ソースコード
#include <bits/stdc++.h> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template <typename T> inline int ssize(const T &a) { return (int)std::size(a); } template <typename T> std::istream &operator>>(std::istream &is, std::vector<T> &a) { for (auto &x : a) is >> x; return is; } template <typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) { return os << "(" << a.first << ", " << a.second << ")"; } template <typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template <typename T, typename = void> struct is_iterable : std::false_type {}; template <typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type {}; template <typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string_view>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } #ifdef ENABLE_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; auto solve() { i64 n; cin >> n; vector<char> p(n + 1, true); vector<int> b(n + 1); p[0] = p[1] = false; REP(i, n + 1) b[i] = i; for (int i = 4; i <= n; i += 2) { p[i] = false; while ((b[i] & 3) == 0) b[i] >>= 2; } for (i64 i = 3; i * i <= n; i += 2) { if (not p[i]) continue; i64 ii = i * i; for (int j = ii; j <= n; j += i) { p[j] = false; while ((b[j] % ii) == 0) b[j] /= ii; } } i64 ans = 0; for (i64 x = 1; x <= n; ++x) { i64 r = std::sqrt(n / b[x]); ans += r; } return ans; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << solve() << "\n"; }