結果
問題 | No.1514 Squared Matching |
ユーザー | rniya |
提出日時 | 2021-05-21 21:34:04 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 595 ms / 4,000 ms |
コード長 | 4,701 bytes |
コンパイル時間 | 2,372 ms |
コンパイル使用メモリ | 198,672 KB |
実行使用メモリ | 393,884 KB |
最終ジャッジ日時 | 2024-04-18 14:47:43 |
合計ジャッジ時間 | 13,301 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 576 ms
393,708 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 12 ms
9,216 KB |
testcase_07 | AC | 110 ms
77,952 KB |
testcase_08 | AC | 570 ms
379,644 KB |
testcase_09 | AC | 488 ms
332,244 KB |
testcase_10 | AC | 526 ms
359,936 KB |
testcase_11 | AC | 544 ms
374,636 KB |
testcase_12 | AC | 575 ms
384,964 KB |
testcase_13 | AC | 572 ms
390,016 KB |
testcase_14 | AC | 595 ms
392,188 KB |
testcase_15 | AC | 570 ms
393,112 KB |
testcase_16 | AC | 570 ms
393,568 KB |
testcase_17 | AC | 571 ms
393,848 KB |
testcase_18 | AC | 574 ms
393,728 KB |
testcase_19 | AC | 569 ms
393,884 KB |
testcase_20 | AC | 568 ms
393,764 KB |
testcase_21 | AC | 571 ms
393,856 KB |
testcase_22 | AC | 117 ms
81,480 KB |
testcase_23 | AC | 233 ms
159,488 KB |
testcase_24 | AC | 352 ms
237,696 KB |
testcase_25 | AC | 461 ms
315,776 KB |
ソースコード
#define LOCAL #include <bits/stdc++.h> using namespace std; #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(), (x).end() template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } void debug_out() { cerr << '\n'; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) \ cerr << " "; \ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \ cerr << " "; \ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } #pragma endregion const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = {'D', 'R', 'U', 'L'}; const long long MOD = 1000000007; // const long long MOD = 998244353; const int SQRT = 10010; int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector<int> val(N + 1); iota(ALL(val), 0); vector<bool> prime(SQRT, true); prime[0] = prime[1] = false; for (int i = 2; i < SQRT; i++) { if (!prime[i]) continue; for (int j = i + i; j < SQRT; j += i) prime[j] = false; int x = i * i; for (int j = x; j <= N; j += x) { while (val[j] % x == 0) { val[j] /= x; } } } vector<int> cnt(N + 1, 0); for (int i = 1; i <= N; i++) cnt[val[i]]++; ll ans = 0; for (int i = 1; i <= N; i++) ans += ll(cnt[i]) * cnt[i]; cout << ans << '\n'; return 0; }