oj.uz

Submission #799654

# Submission time Handle Problem Language Result Execution time Memory
799654 2023-07-31T18:02:48 Z farhan132 Hard route (IZhO17_road) C++17
100 / 100
 635 ms 151704 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 = 5e5 + 5;

ll dist[N], c[N];
vector < ll > v[N];

void dfs(ll s, ll p){
    dist[s] = 0; c[s] = 1;
    for(auto u : v[s]){
        if(u - p){
            dfs(u, s);
            if(dist[u] + 1 > dist[s]){
                dist[s] = dist[u] + 1;
                c[s] = c[u];
            }else{
                if(dist[u] + 1 == dist[s]) c[s] += c[u];
            }
        }
    }
    return;
}

ii ans = {0, 1};

ll knap(vector < ll > c, ll k){
    ll S = 0, ans = 0;
    for(auto u : c){
        ans -= (u * (u - 1)) / 2;
        S += u;
    }
    ans += (S * (S - 1)) / 2;
    return ans;
}

void calc(ll s, ll p, ii best){
    vector < ii > paths;
    if( (!p && v[s].size() == 1) || best.ff > 0) paths.pb(best);
    for(auto u : v[s]){
        if(u - p) paths.pb({dist[u] + 1, c[u]});
    }
    sort(paths.rbegin(), paths.rend());
    if(paths.size() >= 3){
        ll res = (paths[0].ff * (paths[1].ff + paths[2].ff));
        ll cnt = 0;
        if(paths[0].ff == paths[2].ff){
            vector < ll > C;
            for(auto [x, y] : paths){
                if(x == paths[0].ff) C.pb(y);
            }
            cnt = knap(C, 2);
        }else{
            if(paths[0].ff == paths[1].ff){
                for(auto [x, y] : paths){
                    if(x == paths[2].ff) cnt += (paths[0].ss + paths[1].ss) * y;
                }
            }else{
                if(paths[1].ff == paths[2].ff){
                    vector < ll > C;
                    for(auto [x, y] : paths){
                        if(x == paths[1].ff) C.pb(y);
                    }
                    cnt = knap(C, 2);
                }else{
                    for(auto [x, y] : paths){
                        if(x == paths[2].ff) cnt += (paths[1].ss) * y;
                    }
                }  
            }
        }
        if(res > ans.ff){
            ans = {res, cnt};
        }else{
            if(res == ans.ff) ans.ss += cnt;
        }
    }
    ll c1 = 0, c2 = 0;
    for(auto [x, y] : paths){
        if(paths.size() > 0 && paths[0].ff == x) c1 += y;
        if(paths.size() > 1 && paths[1].ff == x) c2 += y;
    }
    for(auto u : v[s]){
        if(u - p){
            if(paths[0].ff == dist[u] + 1){
                if(c[u] == c1){
                    calc(u, s, {paths[1].ff + 1, c2});
                } else {
                    calc(u, s, {paths[0].ff + 1, c1 - c[u]});
                }
            }else{
                calc(u, s, {paths[0].ff + 1, c1});
            }
        }
    }
    return;
}

void solve(){

    ll n; cin >> n;

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


    dfs(1, 0);
    calc(1, 0, {0, 1});

    cout << ans.ff << ' ' << ans.ss << '\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

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

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 12080 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 6 ms 12080 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 12096 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 12068 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 12080 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct
15 Correct 6 ms 11988 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct
17 Correct 6 ms 12056 KB Output is correct
18 Correct 6 ms 12080 KB Output is correct
19 Correct 5 ms 11988 KB Output is correct
20 Correct 6 ms 12084 KB Output is correct
21 Correct 6 ms 11988 KB Output is correct
22 Correct 5 ms 11988 KB Output is correct
23 Correct 5 ms 12080 KB Output is correct
24 Correct 6 ms 11988 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 12080 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 6 ms 12080 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 12096 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 12068 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 12080 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct
15 Correct 6 ms 11988 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct
17 Correct 6 ms 12056 KB Output is correct
18 Correct 6 ms 12080 KB Output is correct
19 Correct 5 ms 11988 KB Output is correct
20 Correct 6 ms 12084 KB Output is correct
21 Correct 6 ms 11988 KB Output is correct
22 Correct 5 ms 11988 KB Output is correct
23 Correct 5 ms 12080 KB Output is correct
24 Correct 6 ms 11988 KB Output is correct
25 Correct 7 ms 12676 KB Output is correct
26 Correct 8 ms 12864 KB Output is correct
27 Correct 11 ms 12884 KB Output is correct
28 Correct 8 ms 12884 KB Output is correct
29 Correct 9 ms 12864 KB Output is correct
30 Correct 8 ms 12856 KB Output is correct
31 Correct 8 ms 12864 KB Output is correct
32 Correct 7 ms 12756 KB Output is correct
33 Correct 8 ms 12752 KB Output is correct
34 Correct 8 ms 12924 KB Output is correct
35 Correct 7 ms 12924 KB Output is correct
36 Correct 8 ms 12860 KB Output is correct
37 Correct 8 ms 12896 KB Output is correct
38 Correct 8 ms 13396 KB Output is correct
39 Correct 7 ms 12672 KB Output is correct
40 Correct 7 ms 12500 KB Output is correct
41 Correct 10 ms 12376 KB Output is correct
42 Correct 7 ms 12372 KB Output is correct
43 Correct 7 ms 12372 KB Output is correct
44 Correct 7 ms 12372 KB Output is correct
45 Correct 7 ms 12348 KB Output is correct
46 Correct 7 ms 12244 KB Output is correct
47 Correct 7 ms 12372 KB Output is correct
48 Correct 7 ms 12604 KB Output is correct

Subtask #3
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 12080 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 6 ms 12080 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 12096 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 12068 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 12080 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct
15 Correct 6 ms 11988 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct
17 Correct 6 ms 12056 KB Output is correct
18 Correct 6 ms 12080 KB Output is correct
19 Correct 5 ms 11988 KB Output is correct
20 Correct 6 ms 12084 KB Output is correct
21 Correct 6 ms 11988 KB Output is correct
22 Correct 5 ms 11988 KB Output is correct
23 Correct 5 ms 12080 KB Output is correct
24 Correct 6 ms 11988 KB Output is correct
25 Correct 7 ms 12676 KB Output is correct
26 Correct 8 ms 12864 KB Output is correct
27 Correct 11 ms 12884 KB Output is correct
28 Correct 8 ms 12884 KB Output is correct
29 Correct 9 ms 12864 KB Output is correct
30 Correct 8 ms 12856 KB Output is correct
31 Correct 8 ms 12864 KB Output is correct
32 Correct 7 ms 12756 KB Output is correct
33 Correct 8 ms 12752 KB Output is correct
34 Correct 8 ms 12924 KB Output is correct
35 Correct 7 ms 12924 KB Output is correct
36 Correct 8 ms 12860 KB Output is correct
37 Correct 8 ms 12896 KB Output is correct
38 Correct 8 ms 13396 KB Output is correct
39 Correct 7 ms 12672 KB Output is correct
40 Correct 7 ms 12500 KB Output is correct
41 Correct 10 ms 12376 KB Output is correct
42 Correct 7 ms 12372 KB Output is correct
43 Correct 7 ms 12372 KB Output is correct
44 Correct 7 ms 12372 KB Output is correct
45 Correct 7 ms 12348 KB Output is correct
46 Correct 7 ms 12244 KB Output is correct
47 Correct 7 ms 12372 KB Output is correct
48 Correct 7 ms 12604 KB Output is correct
49 Correct 422 ms 84804 KB Output is correct
50 Correct 425 ms 92456 KB Output is correct
51 Correct 400 ms 98996 KB Output is correct
52 Correct 392 ms 75856 KB Output is correct
53 Correct 348 ms 97380 KB Output is correct
54 Correct 349 ms 105748 KB Output is correct
55 Correct 339 ms 85584 KB Output is correct
56 Correct 344 ms 94220 KB Output is correct
57 Correct 414 ms 102436 KB Output is correct
58 Correct 377 ms 93772 KB Output is correct
59 Correct 387 ms 93740 KB Output is correct
60 Correct 404 ms 89688 KB Output is correct
61 Correct 634 ms 151704 KB Output is correct
62 Correct 635 ms 131944 KB Output is correct
63 Correct 592 ms 74028 KB Output is correct
64 Correct 618 ms 60332 KB Output is correct
65 Correct 600 ms 51440 KB Output is correct
66 Correct 531 ms 46800 KB Output is correct
67 Correct 540 ms 44408 KB Output is correct
68 Correct 527 ms 43236 KB Output is correct
69 Correct 541 ms 42936 KB Output is correct
70 Correct 546 ms 42740 KB Output is correct
71 Correct 602 ms 42560 KB Output is correct
72 Correct 517 ms 43036 KB Output is correct
73 Correct 505 ms 43076 KB Output is correct
74 Correct 486 ms 43448 KB Output is correct
75 Correct 559 ms 44740 KB Output is correct
76 Correct 521 ms 46704 KB Output is correct
77 Correct 406 ms 52348 KB Output is correct
78 Correct 249 ms 62552 KB Output is correct