oj.uz

답안 #129672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129672 2019-07-13T01:23:11 Z letrongdat Hard route (IZhO17_road) C++17
52 / 100
 2000 ms 162620 KB 
#include <bits/stdc++.h>
using namespace std;
#define forn(i, a, b)               for(int i=a; i<=b; ++i)
#define ford(i, a, b)               for(int i=a; i>=b; --i)
#define repn(i, a, b)               for(int i=a; i <b; ++i)
#define repd(i, a, b)               for(int i=(int)a -1; i>=b; --i)
#define llong                       long long 
#define ii                          pair<llong, llong> 
const llong INF = 1e10 + 1;
const int maxN = 5e5 + 10;
int N;
vector<ii> D[maxN];
vector<int> E[maxN];
ii F[maxN], out[maxN];
void maximize(ii &a, ii b) {
    if (a.first < b.first + 1) {
        a.first = b.first + 1;
        a.second = b.second;
    } else if (a.first == b.first + 1) a.second += b.second;
}
void dfs1(int u, int prv = 0) {
    F[u] = {-INF, 0};
    bool leaf = true;
    for(auto v: E[u]) if (v != prv) {
        leaf = false;
        dfs1(v, u);
        maximize(F[u], F[v]);
        D[u].push_back(F[v]);
    }
    sort(D[u].begin(), D[u].end());
    reverse(D[u].begin(), D[u].end());
    D[u].push_back({-INF, 0});
    if (leaf) F[u] = {0, 1};
}
void dfs2(int u, int prv = 0) {
    out[u] = {-INF, 0};
    if (!prv) out[u] = {0, 1}; 
        else {
            maximize(out[u], out[prv]);
            llong sum2 = 0, maxDist2 = -INF;
            for(auto x: D[prv]) if (x.first + 1 != F[prv].first) {
                maxDist2 = x.first + 1;
                for(auto y: D[prv]) if (y.first == x.first) sum2 += y.second; 
                break;
            }
            if (F[u].first + 1 == F[prv].first) {
                if (F[u].second != F[prv].second) maximize(out[u], {F[prv].first, F[prv].second -F[u].second}); 
                    else maximize(out[u], {maxDist2, sum2});
            } else maximize(out[u], F[prv]);
        }
    for(auto v: E[u]) if (v != prv) dfs2(v, u);
}
int main() {
    ios::sync_with_stdio(0);
    cin >> N;
    repn(i, 1, N) {
        int u, v;
        cin >> u >> v;
        E[u].push_back(v);
        E[v].push_back(u);
    }
    dfs1(1);
    dfs2(1);
    llong result = 0, ways = 0;
    forn(u, 1, N) {
        for(auto &x: D[u]) x.first ++;
        D[u].push_back(out[u]);
        sort(D[u].begin(), D[u].end());
        reverse(D[u].begin(), D[u].end());
        if (D[u].size() <= 3 || D[u][2].first <= 0) continue;
        while (D[u].size() && D[u].back().first != D[u][2].first) D[u].pop_back();
        long long paths, a, ab, abc;
        paths = a = ab = abc = 0;
        if (D[u][0].first == D[u][2].first) {
            for(auto v: D[u]) {
                ab  += v.second * a;
                a   += v.second; 
            }
            paths = ab;
        } else {
            if (D[u][1].first == D[u][2].first) {
                for(auto v: D[u]) if (v.first != D[u][0].first) {
                    ab += v.second  * a;
                    a  += v.second;
                }
                paths = ab;
            } else {
                for(auto v: D[u]) if (v.first == D[u][2].first)
                    a += v.second;
                if (D[u][0].first == D[u][1].first) 
                    paths = (D[u][0].second + D[u][1].second) * a;
                else paths = D[u][1].second * a;
            }
        }
        llong Dist = D[u][0].first * (D[u][1].first + D[u][2].first);
        if (result < Dist) {
            result = Dist;
            ways = paths;
        } else if (result == Dist) ways += paths;
    }
    if (result == 0) ways = 1;
    cout << result << ' ' << ways << '\n';
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 24 ms 23804 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 28 ms 23800 KB Output is correct
8 Correct 28 ms 23928 KB Output is correct
9 Correct 28 ms 23800 KB Output is correct
10 Correct 24 ms 23800 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 28 ms 23800 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 26 ms 23928 KB Output is correct
15 Correct 28 ms 23800 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 23 ms 23800 KB Output is correct
19 Correct 23 ms 23928 KB Output is correct
20 Correct 23 ms 23932 KB Output is correct
21 Correct 22 ms 23800 KB Output is correct
22 Correct 23 ms 23976 KB Output is correct
23 Correct 23 ms 23928 KB Output is correct
24 Correct 23 ms 23800 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 24 ms 23804 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 28 ms 23800 KB Output is correct
8 Correct 28 ms 23928 KB Output is correct
9 Correct 28 ms 23800 KB Output is correct
10 Correct 24 ms 23800 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 28 ms 23800 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 26 ms 23928 KB Output is correct
15 Correct 28 ms 23800 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 23 ms 23800 KB Output is correct
19 Correct 23 ms 23928 KB Output is correct
20 Correct 23 ms 23932 KB Output is correct
21 Correct 22 ms 23800 KB Output is correct
22 Correct 23 ms 23976 KB Output is correct
23 Correct 23 ms 23928 KB Output is correct
24 Correct 23 ms 23800 KB Output is correct
25 Correct 27 ms 24824 KB Output is correct
26 Correct 27 ms 24952 KB Output is correct
27 Correct 27 ms 24952 KB Output is correct
28 Correct 27 ms 24952 KB Output is correct
29 Correct 27 ms 24696 KB Output is correct
30 Correct 27 ms 24824 KB Output is correct
31 Correct 28 ms 24824 KB Output is correct
32 Correct 27 ms 24696 KB Output is correct
33 Correct 28 ms 24952 KB Output is correct
34 Correct 28 ms 24956 KB Output is correct
35 Correct 27 ms 24952 KB Output is correct
36 Correct 28 ms 24952 KB Output is correct
37 Correct 28 ms 24952 KB Output is correct
38 Correct 28 ms 25208 KB Output is correct
39 Correct 28 ms 24824 KB Output is correct
40 Correct 28 ms 24676 KB Output is correct
41 Correct 28 ms 24624 KB Output is correct
42 Correct 27 ms 24696 KB Output is correct
43 Correct 27 ms 24568 KB Output is correct
44 Correct 28 ms 24696 KB Output is correct
45 Correct 28 ms 24568 KB Output is correct
46 Correct 28 ms 24440 KB Output is correct
47 Correct 44 ms 24568 KB Output is correct
48 Correct 72 ms 24532 KB Output is correct

Subtask #3
0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 24 ms 23804 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 28 ms 23800 KB Output is correct
8 Correct 28 ms 23928 KB Output is correct
9 Correct 28 ms 23800 KB Output is correct
10 Correct 24 ms 23800 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 28 ms 23800 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 26 ms 23928 KB Output is correct
15 Correct 28 ms 23800 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 23 ms 23800 KB Output is correct
19 Correct 23 ms 23928 KB Output is correct
20 Correct 23 ms 23932 KB Output is correct
21 Correct 22 ms 23800 KB Output is correct
22 Correct 23 ms 23976 KB Output is correct
23 Correct 23 ms 23928 KB Output is correct
24 Correct 23 ms 23800 KB Output is correct
25 Correct 27 ms 24824 KB Output is correct
26 Correct 27 ms 24952 KB Output is correct
27 Correct 27 ms 24952 KB Output is correct
28 Correct 27 ms 24952 KB Output is correct
29 Correct 27 ms 24696 KB Output is correct
30 Correct 27 ms 24824 KB Output is correct
31 Correct 28 ms 24824 KB Output is correct
32 Correct 27 ms 24696 KB Output is correct
33 Correct 28 ms 24952 KB Output is correct
34 Correct 28 ms 24956 KB Output is correct
35 Correct 27 ms 24952 KB Output is correct
36 Correct 28 ms 24952 KB Output is correct
37 Correct 28 ms 24952 KB Output is correct
38 Correct 28 ms 25208 KB Output is correct
39 Correct 28 ms 24824 KB Output is correct
40 Correct 28 ms 24676 KB Output is correct
41 Correct 28 ms 24624 KB Output is correct
42 Correct 27 ms 24696 KB Output is correct
43 Correct 27 ms 24568 KB Output is correct
44 Correct 28 ms 24696 KB Output is correct
45 Correct 28 ms 24568 KB Output is correct
46 Correct 28 ms 24440 KB Output is correct
47 Correct 44 ms 24568 KB Output is correct
48 Correct 72 ms 24532 KB Output is correct
49 Correct 962 ms 120976 KB Output is correct
50 Correct 1135 ms 125524 KB Output is correct
51 Correct 912 ms 129264 KB Output is correct
52 Correct 880 ms 115916 KB Output is correct
53 Correct 900 ms 116232 KB Output is correct
54 Correct 882 ms 123648 KB Output is correct
55 Correct 863 ms 112356 KB Output is correct
56 Correct 980 ms 117116 KB Output is correct
57 Correct 1030 ms 134388 KB Output is correct
58 Correct 900 ms 129412 KB Output is correct
59 Correct 872 ms 129312 KB Output is correct
60 Correct 886 ms 127052 KB Output is correct
61 Correct 1132 ms 162620 KB Output is correct
62 Correct 1152 ms 151444 KB Output is correct
63 Correct 1159 ms 118008 KB Output is correct
64 Correct 1083 ms 110488 KB Output is correct
65 Correct 1072 ms 105272 KB Output is correct
66 Correct 1034 ms 102644 KB Output is correct
67 Correct 1054 ms 101400 KB Output is correct
68 Correct 1202 ms 100656 KB Output is correct
69 Correct 1304 ms 100256 KB Output is correct
70 Correct 1201 ms 100216 KB Output is correct
71 Correct 1128 ms 99772 KB Output is correct
72 Correct 1233 ms 100120 KB Output is correct
73 Correct 1418 ms 99884 KB Output is correct
74 Execution timed out 2059 ms 99668 KB Time limit exceeded
75 Halted 0 ms 0 KB -