oj.uz

Submission #874630

# Submission time Handle Problem Language Result Execution time Memory
874630 2023-11-17T12:44:22 Z efedmrlr Cat Exercise (JOI23_ho_t4) C++17
100 / 100
 320 ms 65108 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e12+500;
const int N = 2e5+5;
const int ALPH = 26;
const int LGN = 18;
const int MOD = 1e9+7;
int n,m,q;
vector<int> p;
vector<array<int,2> > srtd;

struct DSU {
    int p[N];
    DSU() {
        for(int i = 0; i<N; i++) {
            p[i] = 0;
        }
    }
    void make_set(int x) {
        p[x] = x;
    }
    int find_set(int x) {
        if(x == p[x]) return x;
        return p[x] = find_set(p[x]);
    }
    void union_set(int x, int y) {
        x = find_set(x); y = find_set(y);
        if(x == y) return;
        p[y] = x;
    }
};

int dp[N];
vector<int> adj[N];
int par[N][LGN];
int depth[N];

void dfs(int node) {
    
    for(auto c : adj[node]) {
        if(c == par[node][0]) continue;
        depth[c] = depth[node] + 1;
        par[c][0] = node;
        dfs(c);
    
    }
}

void calc_anc() {
    for(int k = 1; k<LGN; k++) {
        for(int i = 1; i <=n; i++) {
            par[i][k] = par[par[i][k - 1]][k - 1];
        }
    }
}
int kth_anc(int x, int k) {
    for(int i = 0; i<LGN; i++) {
        if((1<<i) & k) {
            x = par[x][i];
        }
    }
    return x;
}
int lca(int x, int y) {
    if(depth[x] < depth[y]) swap(x,y);
    x = kth_anc(x, depth[x] - depth[y]);
    if(x == y) return x;
    for(int i = LGN - 1; i>=0; i--) {
        if(par[x][i] != par[y][i]) {
            x = par[x][i];
            y = par[y][i];
        }
    }
    return par[x][0];
}
int find_dist(int x, int y) {
    int lc = lca(x,y);
    return depth[x] - depth[lc] + depth[y] - depth[lc];
}
inline void solve() {
    cin>>n;
    srtd.resize(n);
    p.resize(n+1);
    REP(i,n) {
        cin>>p[i + 1];
        srtd[i] = {p[i + 1], i + 1};
    }
    sort(srtd.begin(), srtd.end());
    
    for(int i = 0; i<n-1; i++) {
        int a,b;
        cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    DSU ds;
    dfs(1);
    calc_anc();
    for(auto ind : srtd) {
        dp[ind[1]] = 0;
        for(auto c : adj[ind[1]]) {
            if(ds.find_set(c)) {
                int node = ds.find_set(c);
                dp[ind[1]] = max(dp[ind[1]], find_dist(node, ind[1]) + dp[node]);
                
            }
        }
        ds.make_set(ind[1]);
        for(auto c: adj[ind[1]]) {
            if(ds.find_set(c)) {
                ds.union_set(ind[1], c);
            }
        }
    }
    cout<<dp[srtd.back()[1]]<<"\n";

    
}
 
signed main() {
    //freopen("milkvisits.in", "r", stdin);
    //freopen("milkvisits.out", "w", stdout);
    //fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:104:5: note: in expansion of macro 'REP'
  104 |     REP(i,n) {
      |     ^~~

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8280 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 2 ms 8024 KB Output is correct
7 Correct 3 ms 8028 KB Output is correct
8 Correct 2 ms 8028 KB Output is correct
9 Correct 2 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8028 KB Output is correct
12 Correct 3 ms 8028 KB Output is correct
13 Correct 2 ms 8028 KB Output is correct
14 Correct 2 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 3 ms 8024 KB Output is correct
17 Correct 3 ms 8028 KB Output is correct
18 Correct 8 ms 11352 KB Output is correct
19 Correct 9 ms 11356 KB Output is correct
20 Correct 8 ms 11356 KB Output is correct
21 Correct 7 ms 11356 KB Output is correct
22 Correct 8 ms 11396 KB Output is correct
23 Correct 7 ms 11356 KB Output is correct
24 Correct 8 ms 11356 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8280 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 2 ms 8024 KB Output is correct
7 Correct 3 ms 8028 KB Output is correct
8 Correct 2 ms 8028 KB Output is correct
9 Correct 2 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8028 KB Output is correct
12 Correct 3 ms 8028 KB Output is correct
13 Correct 2 ms 8028 KB Output is correct
14 Correct 2 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 3 ms 8024 KB Output is correct
17 Correct 3 ms 8028 KB Output is correct
18 Correct 8 ms 11352 KB Output is correct
19 Correct 9 ms 11356 KB Output is correct
20 Correct 8 ms 11356 KB Output is correct
21 Correct 7 ms 11356 KB Output is correct
22 Correct 8 ms 11396 KB Output is correct
23 Correct 7 ms 11356 KB Output is correct
24 Correct 8 ms 11356 KB Output is correct
25 Correct 2 ms 8028 KB Output is correct
26 Correct 7 ms 11356 KB Output is correct
27 Correct 8 ms 11356 KB Output is correct
28 Correct 8 ms 11328 KB Output is correct
29 Correct 8 ms 11356 KB Output is correct
30 Correct 7 ms 11100 KB Output is correct
31 Correct 7 ms 11100 KB Output is correct
32 Correct 7 ms 11100 KB Output is correct
33 Correct 7 ms 11100 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8280 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 2 ms 8024 KB Output is correct
7 Correct 3 ms 8028 KB Output is correct
8 Correct 2 ms 8028 KB Output is correct
9 Correct 2 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8028 KB Output is correct
12 Correct 3 ms 8028 KB Output is correct
13 Correct 2 ms 8028 KB Output is correct
14 Correct 2 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 3 ms 8024 KB Output is correct
17 Correct 3 ms 8028 KB Output is correct
18 Correct 8 ms 11352 KB Output is correct
19 Correct 9 ms 11356 KB Output is correct
20 Correct 8 ms 11356 KB Output is correct
21 Correct 7 ms 11356 KB Output is correct
22 Correct 8 ms 11396 KB Output is correct
23 Correct 7 ms 11356 KB Output is correct
24 Correct 8 ms 11356 KB Output is correct
25 Correct 249 ms 63452 KB Output is correct
26 Correct 216 ms 64936 KB Output is correct
27 Correct 224 ms 64908 KB Output is correct
28 Correct 267 ms 65108 KB Output is correct
29 Correct 242 ms 64848 KB Output is correct
30 Correct 292 ms 65036 KB Output is correct
31 Correct 252 ms 65060 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Correct 3 ms 8024 KB Output is correct
3 Correct 262 ms 52504 KB Output is correct
4 Correct 263 ms 54096 KB Output is correct
5 Correct 293 ms 54060 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8280 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 2 ms 8024 KB Output is correct
7 Correct 3 ms 8028 KB Output is correct
8 Correct 2 ms 8028 KB Output is correct
9 Correct 2 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8028 KB Output is correct
12 Correct 3 ms 8028 KB Output is correct
13 Correct 2 ms 8028 KB Output is correct
14 Correct 2 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 3 ms 8024 KB Output is correct
17 Correct 3 ms 8028 KB Output is correct
18 Correct 8 ms 11352 KB Output is correct
19 Correct 9 ms 11356 KB Output is correct
20 Correct 8 ms 11356 KB Output is correct
21 Correct 7 ms 11356 KB Output is correct
22 Correct 8 ms 11396 KB Output is correct
23 Correct 7 ms 11356 KB Output is correct
24 Correct 8 ms 11356 KB Output is correct
25 Correct 2 ms 8028 KB Output is correct
26 Correct 7 ms 11356 KB Output is correct
27 Correct 8 ms 11356 KB Output is correct
28 Correct 8 ms 11328 KB Output is correct
29 Correct 8 ms 11356 KB Output is correct
30 Correct 7 ms 11100 KB Output is correct
31 Correct 7 ms 11100 KB Output is correct
32 Correct 7 ms 11100 KB Output is correct
33 Correct 7 ms 11100 KB Output is correct
34 Correct 249 ms 63452 KB Output is correct
35 Correct 216 ms 64936 KB Output is correct
36 Correct 224 ms 64908 KB Output is correct
37 Correct 267 ms 65108 KB Output is correct
38 Correct 242 ms 64848 KB Output is correct
39 Correct 292 ms 65036 KB Output is correct
40 Correct 252 ms 65060 KB Output is correct
41 Correct 2 ms 8024 KB Output is correct
42 Correct 3 ms 8024 KB Output is correct
43 Correct 262 ms 52504 KB Output is correct
44 Correct 263 ms 54096 KB Output is correct
45 Correct 293 ms 54060 KB Output is correct
46 Correct 313 ms 60336 KB Output is correct
47 Correct 313 ms 59044 KB Output is correct
48 Correct 302 ms 60524 KB Output is correct
49 Correct 320 ms 59064 KB Output is correct
50 Correct 293 ms 53664 KB Output is correct
51 Correct 298 ms 53736 KB Output is correct
52 Correct 308 ms 53796 KB Output is correct
53 Correct 294 ms 53680 KB Output is correct