oj.uz

Submission #799694

# Submission time Handle Problem Language Result Execution time Memory
799694 2023-07-31T20:29:50 Z farhan132 Cat Exercise (JOI23_ho_t4) C++17
100 / 100
 306 ms 61972 KB 
/***Farhan132***/
// #pragma GCC optimize("Ofast,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef double dd;
typedef pair<ll , ll> ii;
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clz(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
const ll mod =  (ll) 998244353;
// const ll mod =  (ll) 1e9 + 7;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)2e18;
 
// ll dx[]={0,1,0,-1};
// ll dy[]={1,0,-1,0};
// ll dxx[]={0,1,0,-1,1,1,-1,-1};
// ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 2e5 + 5;

ll dp[N];
vector < ll > v[N];

const ll LG = 19;
ll par[LG][N],  depth[N];
void dfs_LCA(ll s, ll p, ll d){
   depth[s] = d;
   par[0][s] = p;
   for(ll i = 1; i < LG; i++){
      par[i][s] = par[i - 1][par[i - 1][s]];
   }
   for(auto u : v[s]){
      if(u - p){
       dfs_LCA(u , s, d + 1);
      }
   }
   return;
}

ll lca(ll a, ll b){
   if(depth[a] > depth[b]) swap(a, b);
   for(ll i = LG - 1; i >= 0; i--){
      if(depth[b] - (1 << i) >= depth[a]) b = par[i][b];
   }
   if(a == b) return a;
   for(ll i = LG - 1; i >= 0; i--){
      if(par[i][a] != par[i][b]) a = par[i][a], b = par[i][b];
   }
   return par[0][a];
}
ll dist(ll a, ll b){
   return depth[a] + depth[b] - 2*depth[lca(a, b)];
}
ll lift(ll a, ll x){
   for(ll i = LG - 1; i >= 0; i--){
      if((x >> i)&1) a = par[i][a];
   }
   return a;
}
ll kth(ll a, ll b, ll k){
   ll d = dist(a, b);
   assert(k <= d);
   ll L = lca(a, b);
   if(depth[a] - depth[L] >= k){
      return lift(a, k);
   }
   return lift(b, d - k);
}

struct DSU{
    vector < int > par;
    vector < int > mx;
    void start(int n){
        par.resize(n + 1);
        mx.resize(n + 1);
        for(int i = 0; i <= n; i++) par[i] = i, mx[i] = i;
    }
    int find(int a){
        if(a == par[a]) return a;
        return par[a] = find(par[a]);
    }
    void merge(int x, int y){
        x = find(x); y = find(y);
        if(x == y) return;
        par[x] = y;
        mx[y] = max(mx[y], mx[x]);
        return;
    }
}T;

ll p[N], c[N];

void solve(){

    ll n; cin >> n;

    for(ll i = 1; i <= n; i++){
        cin >> p[i];
    }

    for(ll i = 1; i < n; i++){
        ll x, y; cin >> x >> y;
        x = p[x]; y = p[y];
        v[x].pb(y);
        v[y].pb(x);
    }

    dfs_LCA(1, 0, 1);
    T.start(n + 1);
    mem(c, 0);


    for(ll i = 1; i <= n; i++){
        c[i] = 1;
        dp[i] = 0;
        for(auto u : v[i]){
            if(c[u]){
                ll n1 = T.mx[T.find(u)];
                dp[i] = max(dp[i], dp[n1] + dist(n1, i));
                T.merge(i, u);
            }
        }
    }
    cout << dp[n] << '\n';


    
   return;
}

int main() {

    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        auto start_time = clock();
    #else
         // freopen("subsequence.in", "r", stdin);
         // freopen("subsequence.out", "w", stdout); 
         ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif

    //precalc();
 
    ll T = 1, CT = 0;// cin >> T; 
 
    while(T--){
        // cout << "Case #" << ++CT << ": ";
        solve();
    }
    
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:170:15: warning: unused variable 'CT' [-Wunused-variable]
  170 |     ll T = 1, CT = 0;// cin >> T;
      |               ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 3 ms 6740 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 3 ms 6708 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 3 ms 6740 KB Output is correct
8 Correct 3 ms 6740 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 3 ms 6740 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 3 ms 6708 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 3 ms 6740 KB Output is correct
8 Correct 3 ms 6740 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct
11 Correct 3 ms 6740 KB Output is correct
12 Correct 3 ms 6740 KB Output is correct
13 Correct 3 ms 6740 KB Output is correct
14 Correct 3 ms 6740 KB Output is correct
15 Correct 3 ms 6740 KB Output is correct
16 Correct 3 ms 6812 KB Output is correct
17 Correct 3 ms 6712 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 3 ms 6740 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 3 ms 6708 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 3 ms 6740 KB Output is correct
8 Correct 3 ms 6740 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct
11 Correct 3 ms 6740 KB Output is correct
12 Correct 3 ms 6740 KB Output is correct
13 Correct 3 ms 6740 KB Output is correct
14 Correct 3 ms 6740 KB Output is correct
15 Correct 3 ms 6740 KB Output is correct
16 Correct 3 ms 6812 KB Output is correct
17 Correct 3 ms 6712 KB Output is correct
18 Correct 5 ms 7892 KB Output is correct
19 Correct 5 ms 8000 KB Output is correct
20 Correct 5 ms 8004 KB Output is correct
21 Correct 6 ms 7892 KB Output is correct
22 Correct 5 ms 8000 KB Output is correct
23 Correct 5 ms 8020 KB Output is correct
24 Correct 6 ms 8084 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 3 ms 6740 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 3 ms 6708 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 3 ms 6740 KB Output is correct
8 Correct 3 ms 6740 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct
11 Correct 3 ms 6740 KB Output is correct
12 Correct 3 ms 6740 KB Output is correct
13 Correct 3 ms 6740 KB Output is correct
14 Correct 3 ms 6740 KB Output is correct
15 Correct 3 ms 6740 KB Output is correct
16 Correct 3 ms 6812 KB Output is correct
17 Correct 3 ms 6712 KB Output is correct
18 Correct 5 ms 7892 KB Output is correct
19 Correct 5 ms 8000 KB Output is correct
20 Correct 5 ms 8004 KB Output is correct
21 Correct 6 ms 7892 KB Output is correct
22 Correct 5 ms 8000 KB Output is correct
23 Correct 5 ms 8020 KB Output is correct
24 Correct 6 ms 8084 KB Output is correct
25 Correct 3 ms 6740 KB Output is correct
26 Correct 6 ms 8008 KB Output is correct
27 Correct 5 ms 8020 KB Output is correct
28 Correct 5 ms 7956 KB Output is correct
29 Correct 6 ms 8020 KB Output is correct
30 Correct 6 ms 7876 KB Output is correct
31 Correct 6 ms 7892 KB Output is correct
32 Correct 5 ms 7892 KB Output is correct
33 Correct 5 ms 7892 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 3 ms 6740 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 3 ms 6708 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 3 ms 6740 KB Output is correct
8 Correct 3 ms 6740 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct
11 Correct 3 ms 6740 KB Output is correct
12 Correct 3 ms 6740 KB Output is correct
13 Correct 3 ms 6740 KB Output is correct
14 Correct 3 ms 6740 KB Output is correct
15 Correct 3 ms 6740 KB Output is correct
16 Correct 3 ms 6812 KB Output is correct
17 Correct 3 ms 6712 KB Output is correct
18 Correct 5 ms 7892 KB Output is correct
19 Correct 5 ms 8000 KB Output is correct
20 Correct 5 ms 8004 KB Output is correct
21 Correct 6 ms 7892 KB Output is correct
22 Correct 5 ms 8000 KB Output is correct
23 Correct 5 ms 8020 KB Output is correct
24 Correct 6 ms 8084 KB Output is correct
25 Correct 92 ms 57204 KB Output is correct
26 Correct 97 ms 61972 KB Output is correct
27 Correct 96 ms 61960 KB Output is correct
28 Correct 186 ms 61484 KB Output is correct
29 Correct 191 ms 57388 KB Output is correct
30 Correct 186 ms 60376 KB Output is correct
31 Correct 188 ms 59460 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 3 ms 6740 KB Output is correct
3 Correct 280 ms 54032 KB Output is correct
4 Correct 270 ms 54036 KB Output is correct
5 Correct 262 ms 54016 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 3 ms 6740 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 3 ms 6708 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 3 ms 6740 KB Output is correct
8 Correct 3 ms 6740 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct
11 Correct 3 ms 6740 KB Output is correct
12 Correct 3 ms 6740 KB Output is correct
13 Correct 3 ms 6740 KB Output is correct
14 Correct 3 ms 6740 KB Output is correct
15 Correct 3 ms 6740 KB Output is correct
16 Correct 3 ms 6812 KB Output is correct
17 Correct 3 ms 6712 KB Output is correct
18 Correct 5 ms 7892 KB Output is correct
19 Correct 5 ms 8000 KB Output is correct
20 Correct 5 ms 8004 KB Output is correct
21 Correct 6 ms 7892 KB Output is correct
22 Correct 5 ms 8000 KB Output is correct
23 Correct 5 ms 8020 KB Output is correct
24 Correct 6 ms 8084 KB Output is correct
25 Correct 3 ms 6740 KB Output is correct
26 Correct 6 ms 8008 KB Output is correct
27 Correct 5 ms 8020 KB Output is correct
28 Correct 5 ms 7956 KB Output is correct
29 Correct 6 ms 8020 KB Output is correct
30 Correct 6 ms 7876 KB Output is correct
31 Correct 6 ms 7892 KB Output is correct
32 Correct 5 ms 7892 KB Output is correct
33 Correct 5 ms 7892 KB Output is correct
34 Correct 92 ms 57204 KB Output is correct
35 Correct 97 ms 61972 KB Output is correct
36 Correct 96 ms 61960 KB Output is correct
37 Correct 186 ms 61484 KB Output is correct
38 Correct 191 ms 57388 KB Output is correct
39 Correct 186 ms 60376 KB Output is correct
40 Correct 188 ms 59460 KB Output is correct
41 Correct 3 ms 6740 KB Output is correct
42 Correct 3 ms 6740 KB Output is correct
43 Correct 280 ms 54032 KB Output is correct
44 Correct 270 ms 54036 KB Output is correct
45 Correct 262 ms 54016 KB Output is correct
46 Correct 137 ms 59608 KB Output is correct
47 Correct 136 ms 59632 KB Output is correct
48 Correct 152 ms 59636 KB Output is correct
49 Correct 139 ms 59688 KB Output is correct
50 Correct 290 ms 53576 KB Output is correct
51 Correct 306 ms 53660 KB Output is correct
52 Correct 285 ms 53564 KB Output is correct
53 Correct 292 ms 53648 KB Output is correct