oj.uz

Submission #947385

# Submission time Handle Problem Language Result Execution time Memory
947385 2024-03-16T05:23:58 Z gaga999 Hard route (IZhO17_road) C++17
100 / 100
 432 ms 97360 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define int long long
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 5e5 + 5;
vector<int> eg[N];
struct A
{
    int mx, nm;
    A() : mx(0), nm(1) {}
    void operator+=(const A &rh)
    {
        if (rh.mx == mx)
            nm += rh.nm;
        else if (rh.mx > mx)
            *this = rh;
    }
} dp[N], ans;

void dfs(int u, int fa)
{
    for (int v : eg[u])
    {
        if (v == fa)
            continue;
        dfs(v, u);
        dp[u] += dp[v];
    }
    dp[u].mx++;
}

void slv(int u, int fa)
{
    A mx, sc;
    sc.mx = -INF;
    int v0, v1, v2;
    v0 = v1 = v2 = -INF;
    for (int v : eg[u])
    {
        if (dp[v].mx == mx.mx)
            mx.nm += dp[v].nm;
        else
        {
            if (dp[v].mx > mx.mx)
                sc += mx, mx = dp[v];
            else
                sc += dp[v];
        }
        tmax(v2, dp[v].mx);
        if (v2 > v1)
            swap(v1, v2);
        if (v1 > v0)
            swap(v1, v0);
    }
    A cr;
    cr.mx = (0ll + v0) * (v1 + v2);
    if (cr.mx >= ans.mx)
    {
        cr.nm = 0;
        if (v1 == v2)
        {
            int num = 0;
            for (int v : eg[u])
                if (dp[v].mx == v1)
                    num += dp[v].nm, cr.nm -= (dp[v].nm - 1ll) * dp[v].nm;
            cr.nm += (num - 1ll) * num, cr.nm >>= 1;
        }
        else
        {
            int n1 = 0, n2 = 0;
            for (int v : eg[u])
            {
                if (dp[v].mx == v1)
                    n1 += dp[v].nm;
                else if (dp[v].mx == v2)
                    n2 += dp[v].nm;
            }
            cr.nm += n1 * n2;
        }
        ans += cr;
    }
    A pr = dp[u];
    for (int v : eg[u])
    {
        if (v == fa)
            continue;
        if (dp[v].mx == mx.mx)
        {
            if (dp[v].nm == mx.nm)
                dp[u] = sc;
            else
                dp[u] = mx, dp[u].nm -= dp[v].nm;
        }
        else
            dp[u] = mx;
        dp[u].mx++;
        slv(v, u);
    }
    dp[u] = pr;
}

signed main()
{
    int n, x, y;
    rd(n);
    for (int i = 1; i < n; i++)
    {
        rd(x, y);
        eg[x].pb(y);
        eg[y].pb(x);
    }
    dfs(1, -1), slv(1, -1);
    prt(ans.mx), putchar(' ');
    prt(ans.nm), putchar('\n');
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 19800 KB Output is correct
2 Correct 5 ms 19804 KB Output is correct
3 Correct 4 ms 19800 KB Output is correct
4 Correct 4 ms 19800 KB Output is correct
5 Correct 6 ms 19804 KB Output is correct
6 Correct 5 ms 19804 KB Output is correct
7 Correct 5 ms 19804 KB Output is correct
8 Correct 4 ms 19804 KB Output is correct
9 Correct 5 ms 19804 KB Output is correct
10 Correct 4 ms 19804 KB Output is correct
11 Correct 4 ms 19800 KB Output is correct
12 Correct 4 ms 19812 KB Output is correct
13 Correct 5 ms 19804 KB Output is correct
14 Correct 4 ms 19804 KB Output is correct
15 Correct 4 ms 19800 KB Output is correct
16 Correct 4 ms 19800 KB Output is correct
17 Correct 5 ms 19800 KB Output is correct
18 Correct 4 ms 19804 KB Output is correct
19 Correct 4 ms 19804 KB Output is correct
20 Correct 5 ms 19804 KB Output is correct
21 Correct 5 ms 19804 KB Output is correct
22 Correct 4 ms 19804 KB Output is correct
23 Correct 5 ms 19888 KB Output is correct
24 Correct 5 ms 19804 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 19800 KB Output is correct
2 Correct 5 ms 19804 KB Output is correct
3 Correct 4 ms 19800 KB Output is correct
4 Correct 4 ms 19800 KB Output is correct
5 Correct 6 ms 19804 KB Output is correct
6 Correct 5 ms 19804 KB Output is correct
7 Correct 5 ms 19804 KB Output is correct
8 Correct 4 ms 19804 KB Output is correct
9 Correct 5 ms 19804 KB Output is correct
10 Correct 4 ms 19804 KB Output is correct
11 Correct 4 ms 19800 KB Output is correct
12 Correct 4 ms 19812 KB Output is correct
13 Correct 5 ms 19804 KB Output is correct
14 Correct 4 ms 19804 KB Output is correct
15 Correct 4 ms 19800 KB Output is correct
16 Correct 4 ms 19800 KB Output is correct
17 Correct 5 ms 19800 KB Output is correct
18 Correct 4 ms 19804 KB Output is correct
19 Correct 4 ms 19804 KB Output is correct
20 Correct 5 ms 19804 KB Output is correct
21 Correct 5 ms 19804 KB Output is correct
22 Correct 4 ms 19804 KB Output is correct
23 Correct 5 ms 19888 KB Output is correct
24 Correct 5 ms 19804 KB Output is correct
25 Correct 5 ms 20316 KB Output is correct
26 Correct 5 ms 20520 KB Output is correct
27 Correct 5 ms 20312 KB Output is correct
28 Correct 5 ms 20316 KB Output is correct
29 Correct 5 ms 20312 KB Output is correct
30 Correct 5 ms 20316 KB Output is correct
31 Correct 5 ms 20316 KB Output is correct
32 Correct 5 ms 20316 KB Output is correct
33 Correct 5 ms 20316 KB Output is correct
34 Correct 5 ms 20416 KB Output is correct
35 Correct 5 ms 20316 KB Output is correct
36 Correct 6 ms 20312 KB Output is correct
37 Correct 5 ms 20572 KB Output is correct
38 Correct 5 ms 20572 KB Output is correct
39 Correct 6 ms 20312 KB Output is correct
40 Correct 5 ms 20316 KB Output is correct
41 Correct 5 ms 20316 KB Output is correct
42 Correct 5 ms 20060 KB Output is correct
43 Correct 5 ms 20164 KB Output is correct
44 Correct 5 ms 20060 KB Output is correct
45 Correct 5 ms 20060 KB Output is correct
46 Correct 5 ms 20052 KB Output is correct
47 Correct 5 ms 20060 KB Output is correct
48 Correct 5 ms 20272 KB Output is correct

Subtask #3
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 19800 KB Output is correct
2 Correct 5 ms 19804 KB Output is correct
3 Correct 4 ms 19800 KB Output is correct
4 Correct 4 ms 19800 KB Output is correct
5 Correct 6 ms 19804 KB Output is correct
6 Correct 5 ms 19804 KB Output is correct
7 Correct 5 ms 19804 KB Output is correct
8 Correct 4 ms 19804 KB Output is correct
9 Correct 5 ms 19804 KB Output is correct
10 Correct 4 ms 19804 KB Output is correct
11 Correct 4 ms 19800 KB Output is correct
12 Correct 4 ms 19812 KB Output is correct
13 Correct 5 ms 19804 KB Output is correct
14 Correct 4 ms 19804 KB Output is correct
15 Correct 4 ms 19800 KB Output is correct
16 Correct 4 ms 19800 KB Output is correct
17 Correct 5 ms 19800 KB Output is correct
18 Correct 4 ms 19804 KB Output is correct
19 Correct 4 ms 19804 KB Output is correct
20 Correct 5 ms 19804 KB Output is correct
21 Correct 5 ms 19804 KB Output is correct
22 Correct 4 ms 19804 KB Output is correct
23 Correct 5 ms 19888 KB Output is correct
24 Correct 5 ms 19804 KB Output is correct
25 Correct 5 ms 20316 KB Output is correct
26 Correct 5 ms 20520 KB Output is correct
27 Correct 5 ms 20312 KB Output is correct
28 Correct 5 ms 20316 KB Output is correct
29 Correct 5 ms 20312 KB Output is correct
30 Correct 5 ms 20316 KB Output is correct
31 Correct 5 ms 20316 KB Output is correct
32 Correct 5 ms 20316 KB Output is correct
33 Correct 5 ms 20316 KB Output is correct
34 Correct 5 ms 20416 KB Output is correct
35 Correct 5 ms 20316 KB Output is correct
36 Correct 6 ms 20312 KB Output is correct
37 Correct 5 ms 20572 KB Output is correct
38 Correct 5 ms 20572 KB Output is correct
39 Correct 6 ms 20312 KB Output is correct
40 Correct 5 ms 20316 KB Output is correct
41 Correct 5 ms 20316 KB Output is correct
42 Correct 5 ms 20060 KB Output is correct
43 Correct 5 ms 20164 KB Output is correct
44 Correct 5 ms 20060 KB Output is correct
45 Correct 5 ms 20060 KB Output is correct
46 Correct 5 ms 20052 KB Output is correct
47 Correct 5 ms 20060 KB Output is correct
48 Correct 5 ms 20272 KB Output is correct
49 Correct 254 ms 64668 KB Output is correct
50 Correct 223 ms 68220 KB Output is correct
51 Correct 227 ms 71724 KB Output is correct
52 Correct 219 ms 59988 KB Output is correct
53 Correct 185 ms 68988 KB Output is correct
54 Correct 231 ms 72444 KB Output is correct
55 Correct 239 ms 63708 KB Output is correct
56 Correct 183 ms 67412 KB Output is correct
57 Correct 242 ms 72744 KB Output is correct
58 Correct 214 ms 68184 KB Output is correct
59 Correct 221 ms 68304 KB Output is correct
60 Correct 246 ms 66640 KB Output is correct
61 Correct 416 ms 97360 KB Output is correct
62 Correct 419 ms 87492 KB Output is correct
63 Correct 418 ms 58448 KB Output is correct
64 Correct 432 ms 51644 KB Output is correct
65 Correct 385 ms 46976 KB Output is correct
66 Correct 415 ms 44692 KB Output is correct
67 Correct 397 ms 43408 KB Output is correct
68 Correct 367 ms 43088 KB Output is correct
69 Correct 374 ms 42984 KB Output is correct
70 Correct 369 ms 42624 KB Output is correct
71 Correct 397 ms 42832 KB Output is correct
72 Correct 414 ms 42856 KB Output is correct
73 Correct 379 ms 42900 KB Output is correct
74 Correct 374 ms 42984 KB Output is correct
75 Correct 418 ms 43340 KB Output is correct
76 Correct 366 ms 43536 KB Output is correct
77 Correct 269 ms 44768 KB Output is correct
78 Correct 156 ms 46848 KB Output is correct