oj.uz

답안 #129677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129677 2019-07-13T01:54:06 Z letrongdat Hard route (IZhO17_road) C++17
100 / 100
 1305 ms 129944 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 = 2;
const int maxN = 5e5 + 10;
int N;
vector<ii> D[maxN];
vector<int> E[maxN];
ii F[maxN], out[maxN];
llong d2[maxN], sum2[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());
    repn(i, 0, D[u].size()) if (D[u][i].first + 1 != F[u].first) {
        d2[u] = D[u][i].first + 1;
        repn(j, i, D[u].size()) if (D[u][j].first == D[u][i].first) sum2[u] += D[u][j].second; 
           else break;
        break;
    }
    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]);
            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], {d2[prv], sum2[prv]});
            } 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;
        paths = a = ab = 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;
}

Compilation message

road.cpp: In function 'void dfs1(int, int)':
road.cpp:5:52: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define repn(i, a, b)               for(int i=a; i <b; ++i)
road.cpp:33:10:
     repn(i, 0, D[u].size()) if (D[u][i].first + 1 != F[u].first) {
          ~~~~~~~~~~~~~~~~~                          
road.cpp:33:5: note: in expansion of macro 'repn'
     repn(i, 0, D[u].size()) if (D[u][i].first + 1 != F[u].first) {
     ^~~~
road.cpp:5:52: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define repn(i, a, b)               for(int i=a; i <b; ++i)
road.cpp:35:14:
         repn(j, i, D[u].size()) if (D[u][j].first == D[u][i].first) sum2[u] += D[u][j].second; 
              ~~~~~~~~~~~~~~~~~                      
road.cpp:35:9: note: in expansion of macro 'repn'
         repn(j, i, D[u].size()) if (D[u][j].first == D[u][i].first) sum2[u] += D[u][j].second; 
         ^~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 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 23 ms 23800 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 23 ms 23800 KB Output is correct
8 Correct 23 ms 23800 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Correct 23 ms 24056 KB Output is correct
11 Correct 23 ms 23800 KB Output is correct
12 Correct 23 ms 23800 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 24 ms 23932 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 23 ms 23932 KB Output is correct
17 Correct 23 ms 23800 KB Output is correct
18 Correct 23 ms 23800 KB Output is correct
19 Correct 24 ms 23804 KB Output is correct
20 Correct 23 ms 23800 KB Output is correct
21 Correct 23 ms 23800 KB Output is correct
22 Correct 23 ms 23804 KB Output is correct
23 Correct 23 ms 23800 KB Output is correct
24 Correct 23 ms 23800 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 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 23 ms 23800 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 23 ms 23800 KB Output is correct
8 Correct 23 ms 23800 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Correct 23 ms 24056 KB Output is correct
11 Correct 23 ms 23800 KB Output is correct
12 Correct 23 ms 23800 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 24 ms 23932 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 23 ms 23932 KB Output is correct
17 Correct 23 ms 23800 KB Output is correct
18 Correct 23 ms 23800 KB Output is correct
19 Correct 24 ms 23804 KB Output is correct
20 Correct 23 ms 23800 KB Output is correct
21 Correct 23 ms 23800 KB Output is correct
22 Correct 23 ms 23804 KB Output is correct
23 Correct 23 ms 23800 KB Output is correct
24 Correct 23 ms 23800 KB Output is correct
25 Correct 26 ms 24696 KB Output is correct
26 Correct 28 ms 24696 KB Output is correct
27 Correct 27 ms 24824 KB Output is correct
28 Correct 27 ms 24696 KB Output is correct
29 Correct 30 ms 24824 KB Output is correct
30 Correct 28 ms 24824 KB Output is correct
31 Correct 27 ms 24824 KB Output is correct
32 Correct 32 ms 24696 KB Output is correct
33 Correct 32 ms 24696 KB Output is correct
34 Correct 27 ms 24824 KB Output is correct
35 Correct 28 ms 24824 KB Output is correct
36 Correct 32 ms 24732 KB Output is correct
37 Correct 27 ms 24696 KB Output is correct
38 Correct 29 ms 24952 KB Output is correct
39 Correct 27 ms 24568 KB Output is correct
40 Correct 27 ms 24568 KB Output is correct
41 Correct 28 ms 24568 KB Output is correct
42 Correct 27 ms 24568 KB Output is correct
43 Correct 27 ms 24444 KB Output is correct
44 Correct 27 ms 24440 KB Output is correct
45 Correct 27 ms 24440 KB Output is correct
46 Correct 26 ms 24312 KB Output is correct
47 Correct 26 ms 24312 KB Output is correct
48 Correct 26 ms 24440 KB Output is correct

Subtask #3
48.0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 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 23 ms 23800 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 23 ms 23800 KB Output is correct
8 Correct 23 ms 23800 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Correct 23 ms 24056 KB Output is correct
11 Correct 23 ms 23800 KB Output is correct
12 Correct 23 ms 23800 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 24 ms 23932 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 23 ms 23932 KB Output is correct
17 Correct 23 ms 23800 KB Output is correct
18 Correct 23 ms 23800 KB Output is correct
19 Correct 24 ms 23804 KB Output is correct
20 Correct 23 ms 23800 KB Output is correct
21 Correct 23 ms 23800 KB Output is correct
22 Correct 23 ms 23804 KB Output is correct
23 Correct 23 ms 23800 KB Output is correct
24 Correct 23 ms 23800 KB Output is correct
25 Correct 26 ms 24696 KB Output is correct
26 Correct 28 ms 24696 KB Output is correct
27 Correct 27 ms 24824 KB Output is correct
28 Correct 27 ms 24696 KB Output is correct
29 Correct 30 ms 24824 KB Output is correct
30 Correct 28 ms 24824 KB Output is correct
31 Correct 27 ms 24824 KB Output is correct
32 Correct 32 ms 24696 KB Output is correct
33 Correct 32 ms 24696 KB Output is correct
34 Correct 27 ms 24824 KB Output is correct
35 Correct 28 ms 24824 KB Output is correct
36 Correct 32 ms 24732 KB Output is correct
37 Correct 27 ms 24696 KB Output is correct
38 Correct 29 ms 24952 KB Output is correct
39 Correct 27 ms 24568 KB Output is correct
40 Correct 27 ms 24568 KB Output is correct
41 Correct 28 ms 24568 KB Output is correct
42 Correct 27 ms 24568 KB Output is correct
43 Correct 27 ms 24444 KB Output is correct
44 Correct 27 ms 24440 KB Output is correct
45 Correct 27 ms 24440 KB Output is correct
46 Correct 26 ms 24312 KB Output is correct
47 Correct 26 ms 24312 KB Output is correct
48 Correct 26 ms 24440 KB Output is correct
49 Correct 856 ms 108024 KB Output is correct
50 Correct 892 ms 111152 KB Output is correct
51 Correct 888 ms 114168 KB Output is correct
52 Correct 850 ms 104184 KB Output is correct
53 Correct 742 ms 113424 KB Output is correct
54 Correct 738 ms 116584 KB Output is correct
55 Correct 739 ms 108952 KB Output is correct
56 Correct 737 ms 112248 KB Output is correct
57 Correct 823 ms 109268 KB Output is correct
58 Correct 812 ms 105452 KB Output is correct
59 Correct 873 ms 105304 KB Output is correct
60 Correct 806 ms 103672 KB Output is correct
61 Correct 1024 ms 129944 KB Output is correct
62 Correct 1305 ms 121592 KB Output is correct
63 Correct 1024 ms 96900 KB Output is correct
64 Correct 994 ms 90776 KB Output is correct
65 Correct 980 ms 87208 KB Output is correct
66 Correct 990 ms 85144 KB Output is correct
67 Correct 985 ms 84076 KB Output is correct
68 Correct 966 ms 83632 KB Output is correct
69 Correct 1008 ms 83420 KB Output is correct
70 Correct 983 ms 83288 KB Output is correct
71 Correct 975 ms 82964 KB Output is correct
72 Correct 1073 ms 83448 KB Output is correct
73 Correct 1154 ms 83192 KB Output is correct
74 Correct 956 ms 83108 KB Output is correct
75 Correct 964 ms 82816 KB Output is correct
76 Correct 882 ms 89704 KB Output is correct
77 Correct 762 ms 86544 KB Output is correct
78 Correct 475 ms 87888 KB Output is correct