結果
問題 | No.979 Longest Divisor Sequence |
ユーザー | asdf1 |
提出日時 | 2020-01-31 22:32:48 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,850 ms / 2,000 ms |
コード長 | 2,652 bytes |
コンパイル時間 | 9,089 ms |
コンパイル使用メモリ | 269,064 KB |
最終ジャッジ日時 | 2025-01-08 21:17:38 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 188 ms
205,076 KB |
testcase_01 | AC | 187 ms
205,052 KB |
testcase_02 | AC | 188 ms
205,068 KB |
testcase_03 | AC | 186 ms
204,928 KB |
testcase_04 | AC | 189 ms
205,036 KB |
testcase_05 | AC | 186 ms
205,080 KB |
testcase_06 | AC | 187 ms
205,004 KB |
testcase_07 | AC | 186 ms
204,964 KB |
testcase_08 | AC | 190 ms
205,088 KB |
testcase_09 | AC | 184 ms
205,068 KB |
testcase_10 | AC | 201 ms
205,096 KB |
testcase_11 | AC | 205 ms
205,092 KB |
testcase_12 | AC | 242 ms
205,216 KB |
testcase_13 | AC | 251 ms
212,004 KB |
testcase_14 | AC | 1,850 ms
209,756 KB |
testcase_15 | AC | 709 ms
206,712 KB |
ソースコード
#pragma target("avx")#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;typedef pair<ll, ll> P;typedef vector<ll> V;typedef unordered_map<ll, ll> U_MAP;typedef priority_queue<ll> pq;typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;const ll LINF = 1e18;#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)#define rrep(i, a, b) for (ll i = (a); i < (b); i++)#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)#define all(v) (v).begin(), (v).end()#define Size(n) (n).size()#define Cout(x) cout << (x) << endl#define doublecout(a) cout << fixed << setprecision(15) << a << endl;#define fi first#define se second#define m_p make_pair#define p_b push_backstring to_string(string s) { return '"' + s + '"'; }string to_string(const char* s) { return to_string((string)s); }string to_string(bool b) { return (b ? "true" : "false"); }template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto& x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)//------ Believe yourself as a genius!!!!!! ------int dy[] = {1, 0, -1, 0};int dx[] = {0, 1, 0, -1};// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};string alph("abcdefghijklmnopqrstuvwxyz"), s;ll n, cnt, ans, a[ohara], b, c, d, tmp, m, h, w, x, y, sum, k, q;ll dp[ohara];queue<ll> que[3 * 100000 + 1];vector<ll> divisor(ll n) {vector<ll> ret;for (ll i = 1; i * i <= n; i++) {if (n % i == 0) {ret.push_back(i);if (i * i != n) ret.push_back(n / i);}}sort(begin(ret), end(ret));return (ret);}int main(void) {cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cin >> n;rep(i, n) cin >> a[i];rrrep(i, n - 1, 0) { que[a[i]].push(i); }rep(i, n + 1) dp[i] = 1;rrrep(i, n - 1, 0) {vector<ll> yakusuu = divisor(a[i]);rep(j, Size(yakusuu)) {if (yakusuu[j] == a[i] || que[yakusuu[j]].empty()) continue;ll to = que[yakusuu[j]].front();dp[to] = max(dp[i] + 1, dp[to]);}que[a[i]].pop();}rep(i, n) { ans = max(ans, dp[i]); }Cout(ans);return 0;}