fork download
copy 
  1. // ~~ icebear love attttt ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebearat"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 2e5 + 5;
  38. int n, a[N];
  39. vector<int> G[N];
  40. int par[N][19], h[2][N];
  41. vector<int> values[N];
  42. bool active[N], vis[2][N];
  43. int root;
  44.  
  45. void dfs(int u, int type) {
  46.     if (h[type][u] > h[type][root]) root = u;
  47.     vis[type][u] = true;
  48.     for(int v : G[u]) if (!vis[type][v] && active[v]) {
  49.         h[type][v] = h[type][u] + 1;
  50.         dfs(v, type);
  51.     }
  52. }
  53.  
  54. void init(void) {
  55.     cin >> n;
  56.     FOR(i, 1, n) {
  57.         cin >> a[i];
  58.         for(int j = 1; j * j <= a[i]; j++) if (a[i] % j == 0) {
  59.             if (j > 1) values[j].pb(i);
  60.             if (j * j != a[i]) values[a[i] / j].pb(i);
  61.         }
  62.     }
  63.     FOR(i, 2, n) {
  64.         int u, v;
  65.         cin >> u >> v;
  66.         G[u].pb(v);
  67.         G[v].pb(u);
  68.     }
  69. }
  70.  
  71. void process(void) {
  72.     int ans = 0;
  73.     FOR(i, 2, N - 5) if (!values[i].empty()) {
  74.         for(int x : values[i]) active[x] = true;
  75.         for(int x : values[i]) if (!vis[0][x]) {
  76.             root = 0;
  77.             dfs(x, 0);
  78.             dfs(root, 1);
  79.             maximize(ans, h[1][root] + 1);
  80.         }
  81.         for(int x : values[i]) {
  82.             h[0][x] = h[1][x] = 0;
  83.             vis[0][x] = vis[1][x] = active[x] = false;
  84.         }
  85.     }
  86.     cout << ans;
  87. }
  88.  
  89. int main() {
  90.     ios_base::sync_with_stdio(0);
  91.     cin.tie(0); cout.tie(0);
  92.     if (fopen(task".inp", "r")) {
  93.         freopen(task".inp", "r", stdin);
  94.         freopen(task".out", "w", stdout);
  95.     }
  96.     int tc = 1;
  97. //    cin >> tc;
  98.     while(tc--) {
  99.         init();
  100.         process();
  101.     }
  102.     return 0;
  103. }
  104.  
  105.  
Success #stdin #stdout 0.01s 15104KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/1lWqn4
language:
C++14 (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!