結果

問題 No.979 Longest Divisor Sequence
ユーザー kichi2004_kichi2004_
提出日時 2020-01-31 22:32:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,427 bytes
コンパイル時間 2,039 ms
コンパイル使用メモリ 213,604 KB
実行使用メモリ 17,236 KB
最終ジャッジ日時 2024-09-17 09:08:23
合計ジャッジ時間 5,680 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
17,236 KB
testcase_01 AC 3 ms
10,148 KB
testcase_02 AC 3 ms
10,232 KB
testcase_03 AC 3 ms
10,348 KB
testcase_04 WA -
testcase_05 AC 4 ms
12,212 KB
testcase_06 AC 4 ms
10,244 KB
testcase_07 AC 5 ms
10,168 KB
testcase_08 AC 4 ms
10,304 KB
testcase_09 AC 5 ms
10,232 KB
testcase_10 AC 10 ms
10,640 KB
testcase_11 AC 10 ms
10,716 KB
testcase_12 AC 11 ms
10,788 KB
testcase_13 TLE -
testcase_14 -- -
testcase_15 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
//region region
using std::vector;
using std::cin;
using std::cout;
using std::string;
using std::pair;
using std::queue;
using std::priority_queue;
using std::swap;
//endregion
//region define/typedef
#pragma warning(disable:4996)
//auto
#define var auto
#define cvar const auto&
//a..b-1
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); (i)++)
//b..a
#define FORR(i, a, b) for(int (i) = (b); (i) >= (a); (i)--)
//0..n-1
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
//1..n
#define rep1(i, n) for(int (i) = 1; (i) <= (n); (i)++)
//n-1..0
#define repr(i, n) for(int (i) = (n) - 1; (i) >= 0; (i)--)
//n-1..1
#define repr1(i, n) for(int (i) = (n); (i) > 0; (i)--)
#define in1(a) cin >> a
#define in2(a, b) cin >> a >> b
#define in3(a, b, c) cin >> a >> b >> c
#define in4(a, b, c, d) cin >> a >> b >> c >> d
#define in5(a, b, c, d, e) cin >> a >> b >> c >> d >> e
#define pb push_back
#define mp std::make_pair
#define mt std::make_tuple
#define endl "\n"
#define outif(b, t, f) cout << ((b) ? (t) : (f)) << endl
#define bsort(vec) std::sort((vec).begin(), (vec).end())
#define rsort(vec) std::sort((vec).rbegin(), (vec).rend())
#define all(vec) (vec).begin(), (vec).end()
#define even(i) (!(i&1))
#define odd(i) (i&1)
#define sz(x) (int((x).size()))
#define mset(v, n) std::memset((v), n, sizeof(v))
#define setminus(v) mset(v, -1)
#define setzero(v) mset(v, 0)
#define BIT(N) (1LL<<(N))
using ll = long long;
using lld = long double;
using uint = unsigned int;
using vint = vector<int>;
using vlong = vector<ll>;
using vstr = vector<string>;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpil = vector<pil>;
using vpll = vector<pll>;
using vvint = vector<vint>;
using vvlong = vector<vlong>;
using vvstr = vector<vstr>;
const int MAX = INT32_MAX;
const int MIN = INT32_MIN;
const ll MAXL = INT64_MAX;
const ll MINL = INT64_MIN;
//endregion
//region methods/operator
#pragma warning (disable:6031)

ll parse(const string &num) {
  std::stringstream ss;
  ss << num << std::flush;
  ll n;
  ss >> n;
  return n;
}

string to_string(const ll n) {
  std::stringstream ss;
  ss << n << std::flush;
  return ss.str();
}

vector<string> split(const string &s, const string &delim) {
  vector<string> res;
  auto pos = 0;
  while (true) {
    const int found = s.find(delim, pos);
    if (found >= 0) {
      res.push_back(s.substr(pos, found - pos));
    } else {
      res.push_back(s.substr(pos));
      break;
    }
    pos = found + delim.size();
  }
  return res;
}

template<typename T>
string join(vector<T> &vec, const string &sep = " ") {
  var size = vec.size();
  if (size == 0) return "";
  std::stringstream ss;
  for (int i = 0; i < size - 1; i++) {
    ss << vec[i] << sep;
  }
  ss << vec[size - 1];
  return ss.str();
}

template<typename T>
std::istream &operator>>(std::istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}

template<typename T>
void print(T t) {
  cout << t << endl << std::flush;
}

ll powmod(ll a, ll b, ll p) {
  ll res = 1;
  while (b > 0) {
    if (b % 2) res = res * a % p;
    a = a * a % p;
    b >>= 1;
  }
  return res;
}

ll gcd(ll a, ll b) {
  if (a < b) gcd(b, a);
  ll r;
  while ((r = a % b)) {
    a = b;
    b = r;
  }
  return b;
}

ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

template<class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

//endregion
//region initialize

struct iii {
    iii() {
      cin.tie(nullptr);
      std::ios::sync_with_stdio(false);
      cout << std::fixed << std::setprecision(16);
    }
} init;

//endregion

const int max = 300001;
int A[max], memo[max];
vector<std::vector<int>> B;

int dfs(int idx) {
  if (memo[idx]) return memo[idx];
  auto itr = std::upper_bound(all(B[A[idx]]), idx) - B[A[idx]].begin();
  int ans = 1;
  for (; itr < B.at(A[idx]).size(); ++itr) {
    chmax(ans, dfs(B[A[idx]][itr]) + 1);
  }
  return ans;
}

int main() {
  int N; cin >> N;
  rep(i, N) cin >> A[i];
  B.resize(max);

  rep(i, N) {
    for(int j = 1; ll(j) * j <= A[i]; ++j) {
      if(A[i] % j) continue;
      if (j != 1 && ll(j) * j != A[i]) B[A[i] / j].pb(i);
      B[j].pb(i);
    }
  }
  int ans=1;
  rep(i,N)chmax(ans,dfs(i));
  print(ans);

}
0