結果
問題 | No.2756 GCD Teleporter |
ユーザー | AngrySadEight |
提出日時 | 2024-05-10 23:11:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,123 ms / 2,000 ms |
コード長 | 4,717 bytes |
コンパイル時間 | 5,548 ms |
コンパイル使用メモリ | 230,560 KB |
実行使用メモリ | 41,024 KB |
最終ジャッジ日時 | 2024-05-10 23:11:35 |
合計ジャッジ時間 | 31,508 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
8,792 KB |
testcase_01 | AC | 6 ms
8,780 KB |
testcase_02 | AC | 6 ms
8,768 KB |
testcase_03 | AC | 4 ms
8,796 KB |
testcase_04 | AC | 66 ms
10,116 KB |
testcase_05 | AC | 308 ms
14,680 KB |
testcase_06 | AC | 817 ms
24,956 KB |
testcase_07 | AC | 679 ms
21,524 KB |
testcase_08 | AC | 592 ms
20,556 KB |
testcase_09 | AC | 535 ms
18,984 KB |
testcase_10 | AC | 733 ms
23,396 KB |
testcase_11 | AC | 972 ms
27,424 KB |
testcase_12 | AC | 193 ms
12,500 KB |
testcase_13 | AC | 1,008 ms
27,712 KB |
testcase_14 | AC | 941 ms
25,796 KB |
testcase_15 | AC | 202 ms
12,620 KB |
testcase_16 | AC | 507 ms
18,108 KB |
testcase_17 | AC | 639 ms
20,436 KB |
testcase_18 | AC | 187 ms
12,392 KB |
testcase_19 | AC | 1,046 ms
27,928 KB |
testcase_20 | AC | 987 ms
25,936 KB |
testcase_21 | AC | 438 ms
16,704 KB |
testcase_22 | AC | 1,018 ms
26,560 KB |
testcase_23 | AC | 120 ms
10,968 KB |
testcase_24 | AC | 782 ms
22,580 KB |
testcase_25 | AC | 817 ms
23,588 KB |
testcase_26 | AC | 971 ms
25,824 KB |
testcase_27 | AC | 1,020 ms
26,856 KB |
testcase_28 | AC | 505 ms
17,968 KB |
testcase_29 | AC | 789 ms
22,900 KB |
testcase_30 | AC | 1,035 ms
27,076 KB |
testcase_31 | AC | 429 ms
16,420 KB |
testcase_32 | AC | 1,014 ms
24,972 KB |
testcase_33 | AC | 378 ms
14,836 KB |
testcase_34 | AC | 139 ms
11,040 KB |
testcase_35 | AC | 1,010 ms
25,648 KB |
testcase_36 | AC | 989 ms
25,180 KB |
testcase_37 | AC | 6 ms
8,780 KB |
testcase_38 | AC | 1,079 ms
26,800 KB |
testcase_39 | AC | 1,123 ms
41,024 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } int main() { ll N; cin >> N; vector<ll> A(N); for (ll i = 0; i < N; i++) { cin >> A[i]; } vector<vector<ll>> graph(N + 200000, vector<ll>(0)); dsu tree(N + 200000); for (ll i = 0; i < N; i++) { ll A_cpy = A[i]; for (ll j = 2; j * j <= 200000; j++) { bool pos = false; while (true) { if (A_cpy % j != 0) { break; } A_cpy /= j; pos = true; } if (pos) { graph[i].push_back(N + j); graph[N + j].push_back(i); tree.merge(N + j, i); } } if (A_cpy != 1) { graph[i].push_back(A_cpy + N); graph[N + A_cpy].push_back(i); tree.merge(N + A_cpy, i); } } vector<bool> isvisited(N + 200000, false); queue<ll> que; ll comp_num = 0; for (ll i = 0; i < N; i++) { if (isvisited[i]) { continue; } isvisited[i] = true; que.push(i); comp_num++; while (que.size()) { ll p = que.front(); que.pop(); for (ll x : graph[p]) { if (isvisited[x]) { continue; } isvisited[x] = true; que.push(x); } } } bool connect_2 = false; for (ll i = 0; i < N; i++) { if (tree.same(i, N + 2)) { connect_2 = true; } } if (comp_num == 1) { cout << 0 << endl; } else if (comp_num >= 3) { if (connect_2) { cout << (comp_num - 1) * 2 << endl; } else { cout << comp_num * 2 << endl; } } else { bool connect_3 = false; for (ll i = 0; i < N; i++) { if (tree.same(i, N + 3)) { connect_3 = true; } } if (connect_2) { cout << 2 << endl; } else if (connect_3) { cout << 3 << endl; } else { cout << 4 << endl; } } }