oj.uz

Submission #525567

# Submission time Handle Problem Language Result Execution time Memory
525567 2022-02-12T01:12:42 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
5 / 25
 829 ms 108460 KB 
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;

int n, m, dp[20][20971520];
vector<int> tree[200006];
vector<pair<int, int>> adj[200006];

int f(int x, int y) {
    if (dp[x][y] + 1) return dp[x][y];
    if (!y) return dp[x][y] = 0;
    dp[x][y] = (int)1e9;
    for (auto &i: adj[x]) dp[x][y] = min(dp[x][y], i.second + f(i.first, y & ~(1 << i.first)));
    for (auto &i: tree[x]) dp[x][y] = min(dp[x][y], 1 + f(i, y & ~(1 << i)));
    return dp[x][y];
}

int lt[5006][5006], dist[200006], par[200006], depth[200006];
bool cl[200006];

void dfs(int x, int y, int dist = 0, int prev = -1) {
    par[x] = prev;
    lt[y][x] = dist;
    for (auto &i: tree[x]) if (i != prev) {
        depth[i] = depth[x] + 1;
        dfs(i, y, dist + 1, x);
    }
}

int dfs_dist(int x, int prev = -1) {
    int ret = x;
    for (auto &i: tree[x]) if (i != prev) {
        dist[i] = 1 + dist[x];
        int t = dfs_dist(i, x);
        if (dist[t] > dist[ret]) ret = t;
    }
    return ret;
}

int intersect(int x, int y, int z, int w) {
    int ret = 0;
    for (int i = 0; i < n; i++) cl[i] = false;
    if (depth[x] < depth[y]) swap(x, y);
    if (depth[z] < depth[w]) swap(z, w);
    while (depth[x] > depth[y]) cl[x] = true, x = par[x];
    while (x != y) cl[x] = cl[y] = true, x = par[x], y = par[y];
    while (depth[z] > depth[w]) ret += cl[z], z = par[z];
    while (z != w) ret += cl[z], ret += cl[w], z = par[z], w = par[w];
    return ret;
}

int main() {
    scanf("%d%d", &n, &m);
    while (m--) {
        int x, y, w;
        scanf("%d%d%d", &x, &y, &w);
        if (w == 1) {
            tree[x].push_back(y);
            tree[y].push_back(x);
        } else {
            adj[x].push_back({ y, w });
            adj[y].push_back({ x, w });
        }
    }
    if (n <= 20) {
        for (int i = 0; i < n; i++) for (int j = 0; j < 1 << n; j++) dp[i][j] = -1;
        int res = (int)1e9;
        for (int i = 0; i < n; i++) res = min(res, f(i, (1 << n) - 1 ^ 1 << i));
        printf("%d", res);
        return 0;
    }
    for (int i = 0; i < n; i++) dfs(i, i);
    int t = dfs_dist(dist[0] = 0);
    dist[t] = 0;
    int zero = 2 * (n - 1) - dist[dfs_dist(t)], one = (int)1e9, two = (int)1e9;
    for (int i = 0; i < n; i++) for (auto &j: adj[i]) if (i < j.first) one = min(one, j.second + 2 * (n - 1) - lt[i][j.first]);
    /*if (n <= 500) for (int i = 0; i < n; i++) for (auto &j: adj[i]) if (i < j.first) for (int k = 0; k < n; k++) for (auto &l: adj[k]) if (k < l.first) {
        two = min(two, j.second + 2 * (n - 1) - lt[i][l.first] - lt[k][j.first] + intersect(i, l.first, k, j.first));
        two = min(two, j.second + l.second + 2 * (n - 1) - lt[i][k] - lt[l.first][j.first] + intersect(i, k, l.first, j.first));
    }*/
    printf("%d", min({ zero, one, two }));
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:70:66: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   70 |         for (int i = 0; i < n; i++) res = min(res, f(i, (1 << n) - 1 ^ 1 << i));
      |                                                         ~~~~~~~~~^~~
Main.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         scanf("%d%d%d", &x, &y, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9708 KB Output is correct
5 Correct 5 ms 9732 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 5 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9736 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9708 KB Output is correct
5 Correct 5 ms 9732 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 5 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9736 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 5 ms 9676 KB Output is correct
17 Correct 5 ms 9676 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9932 KB Output is correct
20 Correct 6 ms 11724 KB Output is correct
21 Correct 6 ms 11724 KB Output is correct
22 Correct 239 ms 91844 KB Output is correct
23 Correct 48 ms 48716 KB Output is correct
24 Correct 41 ms 48716 KB Output is correct
25 Correct 33 ms 28132 KB Output is correct
26 Correct 63 ms 28240 KB Output is correct
27 Correct 283 ms 91908 KB Output is correct
28 Correct 20 ms 28264 KB Output is correct
29 Correct 32 ms 28256 KB Output is correct
30 Correct 28 ms 28268 KB Output is correct
31 Correct 42 ms 28248 KB Output is correct
32 Correct 11 ms 11720 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 15 ms 28236 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 814 ms 108400 KB Output is correct
2 Correct 828 ms 108460 KB Output is correct
3 Correct 814 ms 108152 KB Output is correct
4 Correct 811 ms 108048 KB Output is correct
5 Correct 719 ms 108120 KB Output is correct
6 Correct 280 ms 108040 KB Output is correct
7 Correct 799 ms 108428 KB Output is correct
8 Correct 752 ms 108236 KB Output is correct
9 Correct 829 ms 108248 KB Output is correct
10 Correct 786 ms 108116 KB Output is correct
11 Correct 791 ms 108128 KB Output is correct
12 Correct 693 ms 107952 KB Output is correct
13 Correct 761 ms 108148 KB Output is correct
14 Correct 774 ms 108192 KB Output is correct

Subtask #4
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9708 KB Output is correct
5 Correct 5 ms 9732 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 5 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9736 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 5 ms 9676 KB Output is correct
17 Correct 5 ms 9676 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9932 KB Output is correct
20 Correct 6 ms 11724 KB Output is correct
21 Correct 6 ms 11724 KB Output is correct
22 Correct 239 ms 91844 KB Output is correct
23 Correct 48 ms 48716 KB Output is correct
24 Correct 41 ms 48716 KB Output is correct
25 Correct 33 ms 28132 KB Output is correct
26 Correct 63 ms 28240 KB Output is correct
27 Correct 283 ms 91908 KB Output is correct
28 Correct 20 ms 28264 KB Output is correct
29 Correct 32 ms 28256 KB Output is correct
30 Correct 28 ms 28268 KB Output is correct
31 Correct 42 ms 28248 KB Output is correct
32 Correct 11 ms 11720 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 15 ms 28236 KB Output is correct
36 Correct 6 ms 10060 KB Output is correct
37 Correct 6 ms 10056 KB Output is correct
38 Correct 6 ms 10068 KB Output is correct
39 Incorrect 5 ms 10060 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #5
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9708 KB Output is correct
5 Correct 5 ms 9732 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 5 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9736 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 5 ms 9676 KB Output is correct
17 Correct 5 ms 9676 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9932 KB Output is correct
20 Correct 6 ms 11724 KB Output is correct
21 Correct 6 ms 11724 KB Output is correct
22 Correct 239 ms 91844 KB Output is correct
23 Correct 48 ms 48716 KB Output is correct
24 Correct 41 ms 48716 KB Output is correct
25 Correct 33 ms 28132 KB Output is correct
26 Correct 63 ms 28240 KB Output is correct
27 Correct 283 ms 91908 KB Output is correct
28 Correct 20 ms 28264 KB Output is correct
29 Correct 32 ms 28256 KB Output is correct
30 Correct 28 ms 28268 KB Output is correct
31 Correct 42 ms 28248 KB Output is correct
32 Correct 11 ms 11720 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 15 ms 28236 KB Output is correct
36 Correct 6 ms 10060 KB Output is correct
37 Correct 6 ms 10056 KB Output is correct
38 Correct 6 ms 10068 KB Output is correct
39 Incorrect 5 ms 10060 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9708 KB Output is correct
5 Correct 5 ms 9732 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 5 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9736 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 5 ms 9676 KB Output is correct
17 Correct 5 ms 9676 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9932 KB Output is correct
20 Correct 6 ms 11724 KB Output is correct
21 Correct 6 ms 11724 KB Output is correct
22 Correct 239 ms 91844 KB Output is correct
23 Correct 48 ms 48716 KB Output is correct
24 Correct 41 ms 48716 KB Output is correct
25 Correct 33 ms 28132 KB Output is correct
26 Correct 63 ms 28240 KB Output is correct
27 Correct 283 ms 91908 KB Output is correct
28 Correct 20 ms 28264 KB Output is correct
29 Correct 32 ms 28256 KB Output is correct
30 Correct 28 ms 28268 KB Output is correct
31 Correct 42 ms 28248 KB Output is correct
32 Correct 11 ms 11720 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 15 ms 28236 KB Output is correct
36 Correct 814 ms 108400 KB Output is correct
37 Correct 828 ms 108460 KB Output is correct
38 Correct 814 ms 108152 KB Output is correct
39 Correct 811 ms 108048 KB Output is correct
40 Correct 719 ms 108120 KB Output is correct
41 Correct 280 ms 108040 KB Output is correct
42 Correct 799 ms 108428 KB Output is correct
43 Correct 752 ms 108236 KB Output is correct
44 Correct 829 ms 108248 KB Output is correct
45 Correct 786 ms 108116 KB Output is correct
46 Correct 791 ms 108128 KB Output is correct
47 Correct 693 ms 107952 KB Output is correct
48 Correct 761 ms 108148 KB Output is correct
49 Correct 774 ms 108192 KB Output is correct
50 Correct 6 ms 10060 KB Output is correct
51 Correct 6 ms 10056 KB Output is correct
52 Correct 6 ms 10068 KB Output is correct
53 Incorrect 5 ms 10060 KB Output isn't correct
54 Halted 0 ms 0 KB -

Subtask #7
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9708 KB Output is correct
5 Correct 5 ms 9732 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 5 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9736 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 5 ms 9676 KB Output is correct
17 Correct 5 ms 9676 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9932 KB Output is correct
20 Correct 6 ms 11724 KB Output is correct
21 Correct 6 ms 11724 KB Output is correct
22 Correct 239 ms 91844 KB Output is correct
23 Correct 48 ms 48716 KB Output is correct
24 Correct 41 ms 48716 KB Output is correct
25 Correct 33 ms 28132 KB Output is correct
26 Correct 63 ms 28240 KB Output is correct
27 Correct 283 ms 91908 KB Output is correct
28 Correct 20 ms 28264 KB Output is correct
29 Correct 32 ms 28256 KB Output is correct
30 Correct 28 ms 28268 KB Output is correct
31 Correct 42 ms 28248 KB Output is correct
32 Correct 11 ms 11720 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 15 ms 28236 KB Output is correct
36 Correct 814 ms 108400 KB Output is correct
37 Correct 828 ms 108460 KB Output is correct
38 Correct 814 ms 108152 KB Output is correct
39 Correct 811 ms 108048 KB Output is correct
40 Correct 719 ms 108120 KB Output is correct
41 Correct 280 ms 108040 KB Output is correct
42 Correct 799 ms 108428 KB Output is correct
43 Correct 752 ms 108236 KB Output is correct
44 Correct 829 ms 108248 KB Output is correct
45 Correct 786 ms 108116 KB Output is correct
46 Correct 791 ms 108128 KB Output is correct
47 Correct 693 ms 107952 KB Output is correct
48 Correct 761 ms 108148 KB Output is correct
49 Correct 774 ms 108192 KB Output is correct
50 Correct 6 ms 10060 KB Output is correct
51 Correct 6 ms 10056 KB Output is correct
52 Correct 6 ms 10068 KB Output is correct
53 Incorrect 5 ms 10060 KB Output isn't correct
54 Halted 0 ms 0 KB -

Subtask #8
0.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9708 KB Output is correct
5 Correct 5 ms 9732 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 5 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9736 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 5 ms 9676 KB Output is correct
17 Correct 5 ms 9676 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9932 KB Output is correct
20 Correct 6 ms 11724 KB Output is correct
21 Correct 6 ms 11724 KB Output is correct
22 Correct 239 ms 91844 KB Output is correct
23 Correct 48 ms 48716 KB Output is correct
24 Correct 41 ms 48716 KB Output is correct
25 Correct 33 ms 28132 KB Output is correct
26 Correct 63 ms 28240 KB Output is correct
27 Correct 283 ms 91908 KB Output is correct
28 Correct 20 ms 28264 KB Output is correct
29 Correct 32 ms 28256 KB Output is correct
30 Correct 28 ms 28268 KB Output is correct
31 Correct 42 ms 28248 KB Output is correct
32 Correct 11 ms 11720 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 15 ms 28236 KB Output is correct
36 Correct 814 ms 108400 KB Output is correct
37 Correct 828 ms 108460 KB Output is correct
38 Correct 814 ms 108152 KB Output is correct
39 Correct 811 ms 108048 KB Output is correct
40 Correct 719 ms 108120 KB Output is correct
41 Correct 280 ms 108040 KB Output is correct
42 Correct 799 ms 108428 KB Output is correct
43 Correct 752 ms 108236 KB Output is correct
44 Correct 829 ms 108248 KB Output is correct
45 Correct 786 ms 108116 KB Output is correct
46 Correct 791 ms 108128 KB Output is correct
47 Correct 693 ms 107952 KB Output is correct
48 Correct 761 ms 108148 KB Output is correct
49 Correct 774 ms 108192 KB Output is correct
50 Correct 6 ms 10060 KB Output is correct
51 Correct 6 ms 10056 KB Output is correct
52 Correct 6 ms 10068 KB Output is correct
53 Incorrect 5 ms 10060 KB Output isn't correct
54 Halted 0 ms 0 KB -