oj.uz

Submission #159726

# Submission time Handle Problem Language Result Execution time Memory
159726 2019-10-24T08:07:38 Z rama_pang Dreaming (IOI13_dreaming) C++14
47 / 100
 112 ms 19448 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;

/*  Find the diameters (d) of all connected components. Let's denote the distance
    from optimal connection point such thay distance from this node to all
    other nodes are minimized as the radius. The radius then must lie on the
    diameter.

    Sort all connected components in descending order, r1 >= r2 >= r3 >=...
    There are two cases:
    - If r1 + r2 + L <= d1
      Then if we connect all components on r1, then the diameter won't ever change.
      In this case, the answer is d1.
    - If r1 + r2 + L > d1
      Let's join these two trees, and find it's radius. It's obvious that the radius
      lies on the path r1-L-r2, with radius rn. We must minimize rn, and since r1 >= r2,
      then the optimal rn is in tree1, since if it is at tree2, them L + r1 > r2, is an
      order of magnitude greater than minimal possible, that is, r1 < L + r2.

      Thus the optimal rn is on the path of r1. However, since r1 + r2 + L > d1 and d1 <= 2 * r1,
      r2 + L > r1. Thus we must minimize the distance to r2, that is, at the position of r1.
      We can just connect all components to the node containing r1. The answer is then the
      maximum of r1 + r2 + L and r2 + r3 + 2 * L, all other radius will yield less.

*/

int dfs(int n, int now, int p, vector<int> &dist, const vector<vector<pair<int, int>>> &G) {
    dist[n] = now;
    int id = n, mx = dist[n];
    for (auto i : G[n]) if (i.second != p) {
        int k = dfs(i.second, now + i.first, n, dist, G);
        if (dist[k] > mx) {
            mx = dist[k];
            id = k;
        }
    }

    return id;
}

bool get_diameter(int n, int t, int p, vector<int> &d, const vector<vector<pair<int, int>>> &G) {
    if (n == t) {
        d.push_back(t);
        return true;
    }

    for (auto i : G[n]) if (i.second != p) {
        if (get_diameter(i.second, t, n, d, G)) {
            d.push_back(n);
            return true;
        }
    }

    return false;
}

void dfs_clear(int n, vector<int> &vis, vector<int> &dist, const vector<vector<pair<int, int>>> &G) {
    if (vis[n] == 1) return;
    dist[n] = 0;
    vis[n] = 1;
    for (auto i : G[n]) dfs_clear(i.second, vis, dist, G);
}

int get_radius(int n, int &max_d, const vector<vector<pair<int, int>>> &G, vector<int> &vis, vector<int> &dist) {
    if (vis[n]) return -1;
    int N = G.size();

    /* two dfs to determine diameter of current connected tree */
    int u = dfs(n, 0, -1, dist, G);
    int v = dfs(u, 0, -1, dist, G);

    vector<int> diameter;
    get_diameter(u, v, -1, diameter, G);
    reverse(diameter.begin(), diameter.end());
    /* u is first element in diameter, v is furthest element */

    int minim = INT_MAX;
    for (auto i : diameter) minim = min(minim, max(dist[i], dist[v] - dist[i]));
    max_d = max(max_d, dist[v]);
    dfs_clear(n, vis, dist, G);
    return minim;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    vector<vector<pair<int, int>>> G(N);
    vector<int> visited(N, 0), dist(N, 0);
    for (int i = 0; i < M; i++) {
        G[A[i]].emplace_back(T[i], B[i]);
        G[B[i]].emplace_back(T[i], A[i]);
    }
    
    priority_queue<int, vector<int>, greater<int>> max_radius;
    int max_d = 0;
    for (int i = 0; i < N; i++) {
        int radius = get_radius(i, max_d, G, visited, dist);
        if (radius != -1) max_radius.push(radius);
        while (max_radius.size() > 3) max_radius.pop();
    }

    vector<int> rad;
    while (!max_radius.empty()) {
        rad.push_back(max_radius.top());
        max_radius.pop();
    }
    
    sort(rad.begin(), rad.end(), greater<int>());
    int res = max({max_d, rad[0] + rad[1] + L, ((rad.size() > 2)? (rad[1] + rad[2] + L + L) : 0)});

    return res;
}

Compilation message

dreaming.cpp: In function 'int get_radius(int, int&, const std::vector<std::vector<std::pair<int, int> > >&, std::vector<int>&, std::vector<int>&)':
dreaming.cpp:67:9: warning: unused variable 'N' [-Wunused-variable]
     int N = G.size();
         ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 16628 KB Output is correct
2 Correct 77 ms 16504 KB Output is correct
3 Correct 51 ms 11000 KB Output is correct
4 Correct 12 ms 2936 KB Output is correct
5 Correct 10 ms 1796 KB Output is correct
6 Correct 22 ms 4088 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 38 ms 6008 KB Output is correct
9 Correct 50 ms 8440 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 69 ms 10616 KB Output is correct
12 Correct 79 ms 13656 KB Output is correct
13 Correct 2 ms 504 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 16628 KB Output is correct
2 Correct 77 ms 16504 KB Output is correct
3 Correct 51 ms 11000 KB Output is correct
4 Correct 12 ms 2936 KB Output is correct
5 Correct 10 ms 1796 KB Output is correct
6 Correct 22 ms 4088 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 38 ms 6008 KB Output is correct
9 Correct 50 ms 8440 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 69 ms 10616 KB Output is correct
12 Correct 79 ms 13656 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 380 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 16628 KB Output is correct
2 Correct 77 ms 16504 KB Output is correct
3 Correct 51 ms 11000 KB Output is correct
4 Correct 12 ms 2936 KB Output is correct
5 Correct 10 ms 1796 KB Output is correct
6 Correct 22 ms 4088 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 38 ms 6008 KB Output is correct
9 Correct 50 ms 8440 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 69 ms 10616 KB Output is correct
12 Correct 79 ms 13656 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 380 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 76 ms 17656 KB Output is correct
40 Correct 75 ms 17528 KB Output is correct
41 Correct 51 ms 11768 KB Output is correct
42 Correct 13 ms 2936 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 380 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 380 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 86 ms 9976 KB Output is correct
58 Correct 87 ms 9976 KB Output is correct
59 Correct 90 ms 10036 KB Output is correct
60 Correct 91 ms 9976 KB Output is correct
61 Correct 86 ms 9976 KB Output is correct
62 Correct 98 ms 10064 KB Output is correct
63 Correct 80 ms 9756 KB Output is correct
64 Correct 80 ms 9592 KB Output is correct
65 Correct 81 ms 9944 KB Output is correct
66 Correct 83 ms 9976 KB Output is correct
67 Correct 89 ms 9976 KB Output is correct
68 Correct 89 ms 9980 KB Output is correct
69 Correct 92 ms 10604 KB Output is correct
70 Correct 92 ms 10232 KB Output is correct
71 Correct 2 ms 256 KB Output is correct
72 Correct 4 ms 632 KB Output is correct
73 Correct 4 ms 632 KB Output is correct
74 Correct 4 ms 632 KB Output is correct
75 Correct 4 ms 632 KB Output is correct
76 Correct 4 ms 504 KB Output is correct
77 Correct 4 ms 632 KB Output is correct
78 Correct 4 ms 632 KB Output is correct
79 Correct 4 ms 632 KB Output is correct
80 Correct 86 ms 9976 KB Output is correct
81 Correct 91 ms 10104 KB Output is correct
82 Correct 87 ms 9976 KB Output is correct
83 Correct 88 ms 9976 KB Output is correct
84 Correct 3 ms 504 KB Output is correct
85 Correct 3 ms 504 KB Output is correct
86 Correct 3 ms 508 KB Output is correct
87 Correct 3 ms 504 KB Output is correct
88 Correct 3 ms 504 KB Output is correct
89 Correct 3 ms 504 KB Output is correct
90 Correct 3 ms 504 KB Output is correct
91 Correct 4 ms 632 KB Output is correct
92 Correct 4 ms 636 KB Output is correct
93 Correct 3 ms 632 KB Output is correct
94 Correct 2 ms 376 KB Output is correct
95 Correct 2 ms 376 KB Output is correct
96 Correct 2 ms 376 KB Output is correct
97 Correct 2 ms 376 KB Output is correct
98 Correct 2 ms 376 KB Output is correct
99 Correct 2 ms 376 KB Output is correct
100 Correct 2 ms 376 KB Output is correct
101 Correct 2 ms 376 KB Output is correct
102 Correct 2 ms 376 KB Output is correct
103 Correct 2 ms 376 KB Output is correct
104 Correct 10 ms 1784 KB Output is correct
105 Correct 20 ms 4216 KB Output is correct
106 Correct 2 ms 376 KB Output is correct
107 Correct 39 ms 6392 KB Output is correct
108 Correct 49 ms 8824 KB Output is correct
109 Correct 2 ms 504 KB Output is correct
110 Correct 71 ms 11512 KB Output is correct
111 Correct 82 ms 14580 KB Output is correct
112 Correct 2 ms 504 KB Output is correct
113 Correct 112 ms 19448 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 5880 KB Output is correct
2 Correct 35 ms 5944 KB Output is correct
3 Correct 34 ms 6008 KB Output is correct
4 Correct 34 ms 6008 KB Output is correct
5 Correct 35 ms 6008 KB Output is correct
6 Correct 37 ms 6388 KB Output is correct
7 Correct 37 ms 6264 KB Output is correct
8 Correct 33 ms 5880 KB Output is correct
9 Correct 34 ms 5964 KB Output is correct
10 Correct 37 ms 6264 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 12 ms 3576 KB Output is correct
13 Correct 12 ms 3576 KB Output is correct
14 Correct 12 ms 3448 KB Output is correct
15 Correct 12 ms 3576 KB Output is correct
16 Correct 12 ms 3452 KB Output is correct
17 Correct 12 ms 3452 KB Output is correct
18 Correct 13 ms 3540 KB Output is correct
19 Correct 12 ms 3448 KB Output is correct
20 Incorrect 2 ms 376 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 16628 KB Output is correct
2 Correct 77 ms 16504 KB Output is correct
3 Correct 51 ms 11000 KB Output is correct
4 Correct 12 ms 2936 KB Output is correct
5 Correct 10 ms 1796 KB Output is correct
6 Correct 22 ms 4088 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 38 ms 6008 KB Output is correct
9 Correct 50 ms 8440 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 69 ms 10616 KB Output is correct
12 Correct 79 ms 13656 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 4 ms 632 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 4 ms 632 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 380 KB Output is correct
40 Incorrect 2 ms 376 KB Output isn't correct
41 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 16628 KB Output is correct
2 Correct 77 ms 16504 KB Output is correct
3 Correct 51 ms 11000 KB Output is correct
4 Correct 12 ms 2936 KB Output is correct
5 Correct 10 ms 1796 KB Output is correct
6 Correct 22 ms 4088 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 38 ms 6008 KB Output is correct
9 Correct 50 ms 8440 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 69 ms 10616 KB Output is correct
12 Correct 79 ms 13656 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 380 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 76 ms 17656 KB Output is correct
40 Correct 75 ms 17528 KB Output is correct
41 Correct 51 ms 11768 KB Output is correct
42 Correct 13 ms 2936 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 380 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 380 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 86 ms 9976 KB Output is correct
58 Correct 87 ms 9976 KB Output is correct
59 Correct 90 ms 10036 KB Output is correct
60 Correct 91 ms 9976 KB Output is correct
61 Correct 86 ms 9976 KB Output is correct
62 Correct 98 ms 10064 KB Output is correct
63 Correct 80 ms 9756 KB Output is correct
64 Correct 80 ms 9592 KB Output is correct
65 Correct 81 ms 9944 KB Output is correct
66 Correct 83 ms 9976 KB Output is correct
67 Correct 89 ms 9976 KB Output is correct
68 Correct 89 ms 9980 KB Output is correct
69 Correct 92 ms 10604 KB Output is correct
70 Correct 92 ms 10232 KB Output is correct
71 Correct 2 ms 256 KB Output is correct
72 Correct 4 ms 632 KB Output is correct
73 Correct 4 ms 632 KB Output is correct
74 Correct 4 ms 632 KB Output is correct
75 Correct 4 ms 632 KB Output is correct
76 Correct 4 ms 504 KB Output is correct
77 Correct 4 ms 632 KB Output is correct
78 Correct 4 ms 632 KB Output is correct
79 Correct 4 ms 632 KB Output is correct
80 Correct 86 ms 9976 KB Output is correct
81 Correct 91 ms 10104 KB Output is correct
82 Correct 87 ms 9976 KB Output is correct
83 Correct 88 ms 9976 KB Output is correct
84 Correct 3 ms 504 KB Output is correct
85 Correct 3 ms 504 KB Output is correct
86 Correct 3 ms 508 KB Output is correct
87 Correct 3 ms 504 KB Output is correct
88 Correct 3 ms 504 KB Output is correct
89 Correct 3 ms 504 KB Output is correct
90 Correct 3 ms 504 KB Output is correct
91 Correct 4 ms 632 KB Output is correct
92 Correct 4 ms 636 KB Output is correct
93 Correct 3 ms 632 KB Output is correct
94 Correct 2 ms 376 KB Output is correct
95 Correct 2 ms 376 KB Output is correct
96 Correct 2 ms 376 KB Output is correct
97 Correct 2 ms 376 KB Output is correct
98 Correct 2 ms 376 KB Output is correct
99 Correct 2 ms 376 KB Output is correct
100 Correct 2 ms 376 KB Output is correct
101 Correct 2 ms 376 KB Output is correct
102 Correct 2 ms 376 KB Output is correct
103 Correct 2 ms 376 KB Output is correct
104 Correct 10 ms 1784 KB Output is correct
105 Correct 20 ms 4216 KB Output is correct
106 Correct 2 ms 376 KB Output is correct
107 Correct 39 ms 6392 KB Output is correct
108 Correct 49 ms 8824 KB Output is correct
109 Correct 2 ms 504 KB Output is correct
110 Correct 71 ms 11512 KB Output is correct
111 Correct 82 ms 14580 KB Output is correct
112 Correct 2 ms 504 KB Output is correct
113 Correct 112 ms 19448 KB Output is correct
114 Correct 35 ms 5880 KB Output is correct
115 Correct 35 ms 5944 KB Output is correct
116 Correct 34 ms 6008 KB Output is correct
117 Correct 34 ms 6008 KB Output is correct
118 Correct 35 ms 6008 KB Output is correct
119 Correct 37 ms 6388 KB Output is correct
120 Correct 37 ms 6264 KB Output is correct
121 Correct 33 ms 5880 KB Output is correct
122 Correct 34 ms 5964 KB Output is correct
123 Correct 37 ms 6264 KB Output is correct
124 Correct 2 ms 376 KB Output is correct
125 Correct 12 ms 3576 KB Output is correct
126 Correct 12 ms 3576 KB Output is correct
127 Correct 12 ms 3448 KB Output is correct
128 Correct 12 ms 3576 KB Output is correct
129 Correct 12 ms 3452 KB Output is correct
130 Correct 12 ms 3452 KB Output is correct
131 Correct 13 ms 3540 KB Output is correct
132 Correct 12 ms 3448 KB Output is correct
133 Incorrect 2 ms 376 KB Output isn't correct
134 Halted 0 ms 0 KB -