oj.uz

Submission #525572

# Submission time Handle Problem Language Result Execution time Memory
525572 2022-02-12T01:34:54 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
5 / 25
 724 ms 108296 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], sz[200006];
bool cl[200006];

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

int dfs(int x, int prev = -1) {
    par[x] = prev;
    sz[x] = 1;
    for (auto &i: tree[x]) if (i != prev) {
        depth[i] = depth[x] + 1;
        sz[x] += dfs(i, x);
    }
    return sz[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]) {
        if (!cl[x]) ret++, cl[x] = true;
        x = par[x];
    }
    while (x != y) {
        if (!cl[x]) ret++, cl[x] = true;
        if (!cl[y]) ret++, cl[y] = true;
        x = par[x], y = par[y];
    }
    while (depth[z] > depth[w]) {
        if (!cl[z]) ret++, cl[z] = true;
        z = par[z];
    }
    while (z != w) {
        if (!cl[z]) ret++, cl[z] = true;
        if (!cl[w]) ret++, cl[w] = true;
        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_lt(i, i);
    int t = dfs_dist(dist[0] = 0);
    dist[t] = 0;
    int s = dfs_dist(t);
    int zero = 2 * (n - 1) - dist[s], one = (int)1e9, two = (int)1e9;
    for (int i = 0; i < n; i++) for (auto &j: adj[i]) if (i < j.first) {
        int curr = j.second + 2 * (n - 1) - lt[i][j.first] - 1;
        /*dfs(i);
        int x = j.first, pv = -1;
        vector<int> v;
        while (depth[x]) {
            v.emplace_back();
            for (auto &i: tree[x]) if (i != pv && i != par[x]) v.back() = max(v.back(), sz[i]);
            pv = x;
            x = par[x];
        }
        int y = *max_element(v.begin(), v.end());
        for (int i = 1; i < (int)v.size(); i++) y = max(y, v[i - 1] + v[i]);
        curr -= y;*/
        one = min(one, curr);
    }
    /*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 + l.second + 2 * (n - 1) - intersect(i, l.first, k, j.first));
        two = min(two, j.second + l.second + 2 * (n - 1) - intersect(i, k, l.first, j.first));
    }*/
    printf("%d", min({ zero, one, two }));
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:90:66: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   90 |         for (int i = 0; i < n; i++) res = min(res, f(i, (1 << n) - 1 ^ 1 << i));
      |                                                         ~~~~~~~~~^~~
Main.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:78:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |         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 9740 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 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 9624 KB Output is correct
11 Correct 5 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 9676 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 9740 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 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 9624 KB Output is correct
11 Correct 5 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 9676 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 176 ms 91912 KB Output is correct
23 Correct 45 ms 48736 KB Output is correct
24 Correct 39 ms 48732 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 66 ms 28244 KB Output is correct
27 Correct 274 ms 91916 KB Output is correct
28 Correct 22 ms 28236 KB Output is correct
29 Correct 31 ms 28248 KB Output is correct
30 Correct 23 ms 28228 KB Output is correct
31 Correct 28 ms 28268 KB Output is correct
32 Correct 11 ms 11724 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 13 ms 28160 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 724 ms 108260 KB Output is correct
2 Correct 681 ms 108296 KB Output is correct
3 Correct 691 ms 108100 KB Output is correct
4 Correct 689 ms 108068 KB Output is correct
5 Correct 674 ms 108012 KB Output is correct
6 Correct 246 ms 107956 KB Output is correct
7 Correct 681 ms 108252 KB Output is correct
8 Correct 710 ms 108100 KB Output is correct
9 Correct 697 ms 108228 KB Output is correct
10 Correct 683 ms 108000 KB Output is correct
11 Correct 691 ms 108076 KB Output is correct
12 Correct 635 ms 107900 KB Output is correct
13 Correct 681 ms 108132 KB Output is correct
14 Correct 682 ms 108184 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 9740 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 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 9624 KB Output is correct
11 Correct 5 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 9676 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 176 ms 91912 KB Output is correct
23 Correct 45 ms 48736 KB Output is correct
24 Correct 39 ms 48732 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 66 ms 28244 KB Output is correct
27 Correct 274 ms 91916 KB Output is correct
28 Correct 22 ms 28236 KB Output is correct
29 Correct 31 ms 28248 KB Output is correct
30 Correct 23 ms 28228 KB Output is correct
31 Correct 28 ms 28268 KB Output is correct
32 Correct 11 ms 11724 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 13 ms 28160 KB Output is correct
36 Correct 5 ms 10060 KB Output is correct
37 Correct 5 ms 10060 KB Output is correct
38 Correct 5 ms 10060 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 9740 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 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 9624 KB Output is correct
11 Correct 5 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 9676 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 176 ms 91912 KB Output is correct
23 Correct 45 ms 48736 KB Output is correct
24 Correct 39 ms 48732 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 66 ms 28244 KB Output is correct
27 Correct 274 ms 91916 KB Output is correct
28 Correct 22 ms 28236 KB Output is correct
29 Correct 31 ms 28248 KB Output is correct
30 Correct 23 ms 28228 KB Output is correct
31 Correct 28 ms 28268 KB Output is correct
32 Correct 11 ms 11724 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 13 ms 28160 KB Output is correct
36 Correct 5 ms 10060 KB Output is correct
37 Correct 5 ms 10060 KB Output is correct
38 Correct 5 ms 10060 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 9740 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 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 9624 KB Output is correct
11 Correct 5 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 9676 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 176 ms 91912 KB Output is correct
23 Correct 45 ms 48736 KB Output is correct
24 Correct 39 ms 48732 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 66 ms 28244 KB Output is correct
27 Correct 274 ms 91916 KB Output is correct
28 Correct 22 ms 28236 KB Output is correct
29 Correct 31 ms 28248 KB Output is correct
30 Correct 23 ms 28228 KB Output is correct
31 Correct 28 ms 28268 KB Output is correct
32 Correct 11 ms 11724 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 13 ms 28160 KB Output is correct
36 Correct 724 ms 108260 KB Output is correct
37 Correct 681 ms 108296 KB Output is correct
38 Correct 691 ms 108100 KB Output is correct
39 Correct 689 ms 108068 KB Output is correct
40 Correct 674 ms 108012 KB Output is correct
41 Correct 246 ms 107956 KB Output is correct
42 Correct 681 ms 108252 KB Output is correct
43 Correct 710 ms 108100 KB Output is correct
44 Correct 697 ms 108228 KB Output is correct
45 Correct 683 ms 108000 KB Output is correct
46 Correct 691 ms 108076 KB Output is correct
47 Correct 635 ms 107900 KB Output is correct
48 Correct 681 ms 108132 KB Output is correct
49 Correct 682 ms 108184 KB Output is correct
50 Correct 5 ms 10060 KB Output is correct
51 Correct 5 ms 10060 KB Output is correct
52 Correct 5 ms 10060 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 9740 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 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 9624 KB Output is correct
11 Correct 5 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 9676 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 176 ms 91912 KB Output is correct
23 Correct 45 ms 48736 KB Output is correct
24 Correct 39 ms 48732 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 66 ms 28244 KB Output is correct
27 Correct 274 ms 91916 KB Output is correct
28 Correct 22 ms 28236 KB Output is correct
29 Correct 31 ms 28248 KB Output is correct
30 Correct 23 ms 28228 KB Output is correct
31 Correct 28 ms 28268 KB Output is correct
32 Correct 11 ms 11724 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 13 ms 28160 KB Output is correct
36 Correct 724 ms 108260 KB Output is correct
37 Correct 681 ms 108296 KB Output is correct
38 Correct 691 ms 108100 KB Output is correct
39 Correct 689 ms 108068 KB Output is correct
40 Correct 674 ms 108012 KB Output is correct
41 Correct 246 ms 107956 KB Output is correct
42 Correct 681 ms 108252 KB Output is correct
43 Correct 710 ms 108100 KB Output is correct
44 Correct 697 ms 108228 KB Output is correct
45 Correct 683 ms 108000 KB Output is correct
46 Correct 691 ms 108076 KB Output is correct
47 Correct 635 ms 107900 KB Output is correct
48 Correct 681 ms 108132 KB Output is correct
49 Correct 682 ms 108184 KB Output is correct
50 Correct 5 ms 10060 KB Output is correct
51 Correct 5 ms 10060 KB Output is correct
52 Correct 5 ms 10060 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 9740 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 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 9624 KB Output is correct
11 Correct 5 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 9676 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 176 ms 91912 KB Output is correct
23 Correct 45 ms 48736 KB Output is correct
24 Correct 39 ms 48732 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 66 ms 28244 KB Output is correct
27 Correct 274 ms 91916 KB Output is correct
28 Correct 22 ms 28236 KB Output is correct
29 Correct 31 ms 28248 KB Output is correct
30 Correct 23 ms 28228 KB Output is correct
31 Correct 28 ms 28268 KB Output is correct
32 Correct 11 ms 11724 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 14 ms 28236 KB Output is correct
35 Correct 13 ms 28160 KB Output is correct
36 Correct 724 ms 108260 KB Output is correct
37 Correct 681 ms 108296 KB Output is correct
38 Correct 691 ms 108100 KB Output is correct
39 Correct 689 ms 108068 KB Output is correct
40 Correct 674 ms 108012 KB Output is correct
41 Correct 246 ms 107956 KB Output is correct
42 Correct 681 ms 108252 KB Output is correct
43 Correct 710 ms 108100 KB Output is correct
44 Correct 697 ms 108228 KB Output is correct
45 Correct 683 ms 108000 KB Output is correct
46 Correct 691 ms 108076 KB Output is correct
47 Correct 635 ms 107900 KB Output is correct
48 Correct 681 ms 108132 KB Output is correct
49 Correct 682 ms 108184 KB Output is correct
50 Correct 5 ms 10060 KB Output is correct
51 Correct 5 ms 10060 KB Output is correct
52 Correct 5 ms 10060 KB Output is correct
53 Incorrect 5 ms 10060 KB Output isn't correct
54 Halted 0 ms 0 KB -