結果
問題 | No.979 Longest Divisor Sequence |
ユーザー | Pachicobue |
提出日時 | 2020-02-01 01:24:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 483 ms / 2,000 ms |
コード長 | 9,033 bytes |
コンパイル時間 | 2,136 ms |
コンパイル使用メモリ | 210,692 KB |
最終ジャッジ日時 | 2025-01-08 21:29:58 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
10,240 KB |
testcase_01 | AC | 6 ms
10,340 KB |
testcase_02 | AC | 5 ms
10,328 KB |
testcase_03 | AC | 5 ms
10,268 KB |
testcase_04 | AC | 7 ms
10,360 KB |
testcase_05 | AC | 8 ms
10,260 KB |
testcase_06 | AC | 7 ms
10,244 KB |
testcase_07 | AC | 6 ms
10,356 KB |
testcase_08 | AC | 7 ms
10,312 KB |
testcase_09 | AC | 7 ms
10,320 KB |
testcase_10 | AC | 6 ms
10,604 KB |
testcase_11 | AC | 6 ms
10,572 KB |
testcase_12 | AC | 6 ms
10,756 KB |
testcase_13 | AC | 41 ms
34,284 KB |
testcase_14 | AC | 483 ms
108,476 KB |
testcase_15 | AC | 92 ms
33,132 KB |
ソースコード
#include <bits/stdc++.h>// created [2020/02/01] 01:13:16#pragma GCC diagnostic ignored "-Wsign-compare"#pragma GCC diagnostic ignored "-Wsign-conversion"using i32 = int32_t;using i64 = int64_t;using u32 = uint32_t;using u64 = uint64_t;using uint = unsigned int;using usize = std::size_t;using ll = long long;using ull = unsigned long long;using ld = long double;template<typename T, usize n>using arr = T (&)[n];template<typename T, usize n>using c_arr = const T (&)[n];template<typename T>using max_heap = std::priority_queue<T>;template<typename T>using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask)<< (64 - ind)) >> (64 - ind)); }template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }constexpr unsigned int mod = 1000000007;template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };template<typename T>T in(){T v;return std::cin >> v, v;}template<typename T, typename Uint, usize n, usize i>T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }template<typename T, typename Uint, usize n, usize i>auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs){const usize s = (usize)szs[i];std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }return ans;}template<typename T, typename Uint, usize n>auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }template<typename... Types>auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }struct io_init{io_init(){std::cin.tie(nullptr), std::ios::sync_with_stdio(false);std::cout << std::fixed << std::setprecision(20);}void clear(){std::cin.tie(), std::ios::sync_with_stdio(true);}} io_setting;int out() { return 0; }template<typename T>int out(const T& v) { return std::cout << v, 0; }template<typename T>int out(const std::vector<T>& v){for (usize i = 0; i < v.size(); i++) {if (i > 0) { std::cout << ' '; }out(v[i]);}return 0;}template<typename T1, typename T2>int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }template<typename T, typename... Args>int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }template<typename... Args>int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }template<typename... Args>int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }# define SHOW(...) static_cast<void>(0)constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }template<typename T, typename Uint, usize n, usize i>auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }template<typename T, typename Uint, usize n, usize i>auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{}){const usize s = (usize)szs[i];return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));}template<typename T, typename Uint, usize n>auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }template<typename Cost = usize>struct edge{using cost_type = Cost;usize u, v;Cost c;edge(const usize u, const usize v) : u{u}, v{v}, c{1} {}edge(const usize u, const usize v, const Cost& c) : u{u}, v{v}, c{c} {}operator usize() const { return v; }usize from() const { return u; }usize to() const { return v; }Cost cost() const { return c; }friend std::ostream& operator<<(std::ostream& os, const edge& e) { return os << e.u << "->" << e.v << ":" << e.c; }};template<typename Edge>class base_graph{public:base_graph(const usize n) : v{n}, es(n), res(n) {}void add_edge(const usize u, const usize v, const bool bi = false){es[u].emplace_back(u, v), res[v].emplace_back(v, u);if (bi) { es[v].emplace_back(v, u), res[u].emplace_back(u, v); }}template<typename Cost>void add_edge(const usize u, const usize v, const Cost& c, const bool bi = false){es[u].emplace_back(u, v, c), res[v].emplace_back(v, u, c);if (bi) { es[v].emplace_back(v, u, c), res[u].emplace_back(u, v, c); }}std::vector<Edge>& operator[](const usize u) { return es[u]; }const std::vector<Edge>& operator[](const usize u) const { return es[u]; }std::vector<Edge>& from(const usize u) { return es[u]; }const std::vector<Edge>& from(const usize u) const { return es[u]; }std::vector<Edge>& to(const usize v) { return res[v]; }const std::vector<Edge>& to(const usize v) const { return res[v]; }usize size() const { return v; }friend std::ostream& operator<<(std::ostream& os, const base_graph& g){for (usize i = 0; i < g.v; i++) {for (const auto& e : g.es[i]) { os << e << '\n'; }}return os;}private:usize v;std::vector<std::vector<Edge>> es, res;};template<typename Edge>using base_tree = base_graph<Edge>;using graph = base_graph<edge<>>;using tree = base_graph<edge<>>;template<typename Cost>using cost_graph = base_graph<edge<Cost>>;template<typename Cost>using cost_tree = base_graph<edge<Cost>>;template<typename Edge>std::pair<bool, std::vector<usize>> top_sort(const base_graph<Edge>& g){const usize v = g.size();std::vector<usize> srt, used(v, 0);auto dfs = [&](auto&& self, const usize s) -> bool {if (used[s] == 1) {return false;} else if (used[s] == 0) {used[s] = 1;for (const auto& e : g[s]) {const usize to = e.to();if (not self(self, to)) { return false; }}used[s] = 2, srt.push_back(s);}return true;};for (usize i = 0; i < v; i++) {if (not dfs(dfs, i)) { return {false, srt}; }}std::reverse(srt.begin(), srt.end());return {true, srt};}int main(){const auto N = in<int>();const auto as = in_v<int>({N});constexpr int A = 300000;std::vector<std::vector<int>> pos(A + 1);for (int i = 0; i < N; i++) { pos[as[i]].push_back(i); }graph g(N);for (int a = 1; a <= A; a++) {if (pos[a].empty()) { continue; }for (int b = 2 * a; b <= A; b += a) {for (const int ai : pos[a]) {auto it = std::lower_bound(pos[b].begin(), pos[b].end(), ai);if (it == pos[b].end()) { break; }const int bi = *it;g.add_edge(ai, bi);}}}const auto vs = top_sort(g).second;std::vector<int> dp(N, 0);for (const int v : vs) {for (const int to : g[v]) { chmax(dp[to], dp[v] + 1); }}outln(*std::max_element(dp.begin(), dp.end()) + 1);return 0;}