oj.uz

Submission #945285

# Submission time Handle Problem Language Result Execution time Memory
945285 2024-03-13T15:42:28 Z GrandTiger1729 Hard route (IZhO17_road) C++17
52 / 100
 559 ms 163872 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        u--, v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<vector<pair<int, int>>> res(n);
    {
        vector<bool> vis(n);
        function<pair<int, int>(int)> dfs = [&](int u) -> pair<int, int>
        {
            res[u].resize(g[u].size());
            vis[u] = 1;
            pair<int, int> ret(0, 1);
            for (int i = 0; i < g[u].size(); i++)
            {
                int v = g[u][i];
                if (vis[v])
                {
                    continue;
                }
                res[u][i] = dfs(v);
                if (res[u][i].first > ret.first)
                {
                    ret = res[u][i];
                }
                else if (res[u][i].first == ret.first)
                {
                    ret.second += res[u][i].second;
                }
            }
            ret.first++;
            return ret;
        };
        dfs(0);
    }
    long long ans = 0, cnt = 1;
    auto update = [&](long long x, long long y)
    {
        if (y == 0)
        {
            return;
        }
        if (ans < x)
        {
            ans = x;
            cnt = y;
        }
        else if (ans == x)
        {
            cnt += y;
        }
    };
    {
        vector<bool> vis(n);
        function<void(int, pair<int, int>)> dfs = [&](int u, pair<int, int> cur)
        {
            vis[u] = 1;
            multiset<pair<int, int>> st;
            for (int i = 0; i < g[u].size(); i++)
            {
                int v = g[u][i];
                if (vis[v])
                {
                    continue;
                }
                st.insert(res[u][i]);
            }
            if (u != 0)
            {
                st.insert(cur);
            }
            if (st.size() >= 3)
            {
                auto it = --st.end();
                auto it3 = it--;
                auto it2 = it--;
                if (it->first == it3->first)
                {
                    int tot = it->second + it2->second + it3->second;
                    long long tot2 = 1ll * it->second * it->second + 1ll * it2->second * it2->second + 1ll * it3->second * it3->second;
                    auto it4 = it;
                    while (it4 != st.begin() && it4->first == it->first)
                    {
                        it4--;
                        tot += it4->second;
                        tot2 += 1ll * it4->second * it4->second;
                    }
                    update(1ll * (it->first + it2->first) * it3->first, (1ll * tot * tot - tot2) / 2);
                }
                else if (it2->first == it3->first)
                {
                    update(1ll * (it->first + it2->first) * it3->first, 1ll * it->second * (it2->second + it3->second));
                }
                else
                {
                    update(1ll * (it->first + it2->first) * it3->first, 1ll * it->second * it2->second);
                }
            }
            map<int, int> mp;
            for (int i = 0; i < g[u].size(); i++)
            {
                int v = g[u][i];
                if (vis[v])
                {
                    continue;
                }
                mp[res[u][i].first] += res[u][i].second;
            }
            mp[cur.first] += cur.second;
            for (int i = 0; i < g[u].size(); i++)
            {
                int v = g[u][i];
                if (vis[v])
                {
                    continue;
                }
                mp[res[u][i].first] -= res[u][i].second;
                if ((--mp.end())->second == 0)
                {
                    mp.erase(--mp.end());
                }
                pair<int, int> x = *(--mp.end());
                x.first++;
                dfs(v, x);
                mp[res[u][i].first] += res[u][i].second;
            }
        };
        dfs(0, make_pair(0, 1));
    }
    cout << ans << ' ' << cnt << '\n';
    return 0;
}

Compilation message

road.cpp: In lambda function:
road.cpp:27:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             for (int i = 0; i < g[u].size(); i++)
      |                             ~~^~~~~~~~~~~~~
road.cpp: In lambda function:
road.cpp:72:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             for (int i = 0; i < g[u].size(); i++)
      |                             ~~^~~~~~~~~~~~~
road.cpp:113:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |             for (int i = 0; i < g[u].size(); i++)
      |                             ~~^~~~~~~~~~~~~
road.cpp:123:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |             for (int i = 0; i < g[u].size(); i++)
      |                             ~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

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

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 1628 KB Output is correct
26 Correct 3 ms 1884 KB Output is correct
27 Correct 3 ms 1884 KB Output is correct
28 Correct 3 ms 1884 KB Output is correct
29 Correct 3 ms 1884 KB Output is correct
30 Correct 5 ms 2140 KB Output is correct
31 Correct 5 ms 1900 KB Output is correct
32 Correct 3 ms 1628 KB Output is correct
33 Correct 3 ms 1884 KB Output is correct
34 Correct 3 ms 2140 KB Output is correct
35 Correct 3 ms 1884 KB Output is correct
36 Correct 3 ms 1884 KB Output is correct
37 Correct 4 ms 2188 KB Output is correct
38 Correct 4 ms 2904 KB Output is correct
39 Correct 3 ms 1628 KB Output is correct
40 Correct 3 ms 1116 KB Output is correct
41 Correct 3 ms 1116 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 3 ms 1112 KB Output is correct
45 Correct 2 ms 1056 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 2 ms 1112 KB Output is correct
48 Correct 2 ms 1116 KB Output is correct

Subtask #3
0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 1628 KB Output is correct
26 Correct 3 ms 1884 KB Output is correct
27 Correct 3 ms 1884 KB Output is correct
28 Correct 3 ms 1884 KB Output is correct
29 Correct 3 ms 1884 KB Output is correct
30 Correct 5 ms 2140 KB Output is correct
31 Correct 5 ms 1900 KB Output is correct
32 Correct 3 ms 1628 KB Output is correct
33 Correct 3 ms 1884 KB Output is correct
34 Correct 3 ms 2140 KB Output is correct
35 Correct 3 ms 1884 KB Output is correct
36 Correct 3 ms 1884 KB Output is correct
37 Correct 4 ms 2188 KB Output is correct
38 Correct 4 ms 2904 KB Output is correct
39 Correct 3 ms 1628 KB Output is correct
40 Correct 3 ms 1116 KB Output is correct
41 Correct 3 ms 1116 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 3 ms 1112 KB Output is correct
45 Correct 2 ms 1056 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 2 ms 1112 KB Output is correct
48 Correct 2 ms 1116 KB Output is correct
49 Correct 559 ms 137540 KB Output is correct
50 Correct 549 ms 151992 KB Output is correct
51 Correct 551 ms 163872 KB Output is correct
52 Incorrect 518 ms 120596 KB Output isn't correct
53 Halted 0 ms 0 KB -