oj.uz

답안 #525773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525773 2022-02-12T20:29:27 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
5 / 25
 707 ms 108608 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], par[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) {
        sz[x] = max(sz[x], dfs(i, x) + 1);
    }
    return sz[x];
}

int dist[200006];
 
int dfs_dist(int x, int prev = -1) {
    vector<int> v;
    int ret = 0;
    dist[x] = 0;
    for (auto &i: tree[x]) if (i != prev) {
        v.push_back(dfs_dist(i, x) + 1);
        ret = max(ret, v.back());
        dist[x] = max(dist[x], dist[i]);
    }
    sort(v.rbegin(), v.rend());
    if (!v.empty()) dist[x] = max(dist[x], v[0]);
    if ((int)v.size() > 1) dist[x] = max(dist[x], v[0] + v[1]);
    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);
    dfs_dist(0);
    int zero = 2 * (n - 1) - dist[0], one = (int)1e9;
    if (n <= 1000) 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;
        int y = -1;
        dfs_dist(i);
        while (x != -1) {
            v.emplace_back();
            for (auto &k: tree[x]) if (k != pv && k != par[x]) {
                v.back() = max(v.back(), sz[k]);
                y = max(y, dist[k] - 1);
            }
            pv = x;
            x = par[x];
        }
        for (int i = 0; i < (int)v.size(); i++) for (int j = i + 1; j < (int)v.size(); j++) y = max(y, v[i] + v[j] - (j - i - 1));
        curr -= y;
        one = min(one, curr);
    }
    printf("%d", min(zero, one));
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9688 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9740 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 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9688 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9740 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 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9720 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 169 ms 92032 KB Output is correct
23 Correct 50 ms 48812 KB Output is correct
24 Correct 40 ms 48716 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 57 ms 28192 KB Output is correct
27 Correct 271 ms 91912 KB Output is correct
28 Correct 20 ms 28236 KB Output is correct
29 Correct 30 ms 28264 KB Output is correct
30 Correct 23 ms 28264 KB Output is correct
31 Correct 27 ms 28264 KB Output is correct
32 Correct 11 ms 11728 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 13 ms 28216 KB Output is correct
35 Correct 14 ms 28268 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 707 ms 108392 KB Output is correct
2 Correct 703 ms 108608 KB Output is correct
3 Correct 671 ms 108248 KB Output is correct
4 Correct 665 ms 108044 KB Output is correct
5 Correct 673 ms 108100 KB Output is correct
6 Correct 246 ms 108036 KB Output is correct
7 Correct 670 ms 108364 KB Output is correct
8 Correct 689 ms 108288 KB Output is correct
9 Correct 697 ms 108484 KB Output is correct
10 Correct 662 ms 108224 KB Output is correct
11 Correct 653 ms 108468 KB Output is correct
12 Correct 643 ms 107844 KB Output is correct
13 Correct 657 ms 108100 KB Output is correct
14 Correct 659 ms 108140 KB Output is correct

Subtask #4
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9688 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9740 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 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9720 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 169 ms 92032 KB Output is correct
23 Correct 50 ms 48812 KB Output is correct
24 Correct 40 ms 48716 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 57 ms 28192 KB Output is correct
27 Correct 271 ms 91912 KB Output is correct
28 Correct 20 ms 28236 KB Output is correct
29 Correct 30 ms 28264 KB Output is correct
30 Correct 23 ms 28264 KB Output is correct
31 Correct 27 ms 28264 KB Output is correct
32 Correct 11 ms 11728 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 13 ms 28216 KB Output is correct
35 Correct 14 ms 28268 KB Output is correct
36 Correct 6 ms 10060 KB Output is correct
37 Correct 7 ms 10132 KB Output is correct
38 Correct 6 ms 10060 KB Output is correct
39 Incorrect 6 ms 10060 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #5
0.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9688 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9740 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 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9720 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 169 ms 92032 KB Output is correct
23 Correct 50 ms 48812 KB Output is correct
24 Correct 40 ms 48716 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 57 ms 28192 KB Output is correct
27 Correct 271 ms 91912 KB Output is correct
28 Correct 20 ms 28236 KB Output is correct
29 Correct 30 ms 28264 KB Output is correct
30 Correct 23 ms 28264 KB Output is correct
31 Correct 27 ms 28264 KB Output is correct
32 Correct 11 ms 11728 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 13 ms 28216 KB Output is correct
35 Correct 14 ms 28268 KB Output is correct
36 Correct 6 ms 10060 KB Output is correct
37 Correct 7 ms 10132 KB Output is correct
38 Correct 6 ms 10060 KB Output is correct
39 Incorrect 6 ms 10060 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9688 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9740 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 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9720 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 169 ms 92032 KB Output is correct
23 Correct 50 ms 48812 KB Output is correct
24 Correct 40 ms 48716 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 57 ms 28192 KB Output is correct
27 Correct 271 ms 91912 KB Output is correct
28 Correct 20 ms 28236 KB Output is correct
29 Correct 30 ms 28264 KB Output is correct
30 Correct 23 ms 28264 KB Output is correct
31 Correct 27 ms 28264 KB Output is correct
32 Correct 11 ms 11728 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 13 ms 28216 KB Output is correct
35 Correct 14 ms 28268 KB Output is correct
36 Correct 707 ms 108392 KB Output is correct
37 Correct 703 ms 108608 KB Output is correct
38 Correct 671 ms 108248 KB Output is correct
39 Correct 665 ms 108044 KB Output is correct
40 Correct 673 ms 108100 KB Output is correct
41 Correct 246 ms 108036 KB Output is correct
42 Correct 670 ms 108364 KB Output is correct
43 Correct 689 ms 108288 KB Output is correct
44 Correct 697 ms 108484 KB Output is correct
45 Correct 662 ms 108224 KB Output is correct
46 Correct 653 ms 108468 KB Output is correct
47 Correct 643 ms 107844 KB Output is correct
48 Correct 657 ms 108100 KB Output is correct
49 Correct 659 ms 108140 KB Output is correct
50 Correct 6 ms 10060 KB Output is correct
51 Correct 7 ms 10132 KB Output is correct
52 Correct 6 ms 10060 KB Output is correct
53 Incorrect 6 ms 10060 KB Output isn't correct
54 Halted 0 ms 0 KB -

Subtask #7
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9688 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9740 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 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9720 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 169 ms 92032 KB Output is correct
23 Correct 50 ms 48812 KB Output is correct
24 Correct 40 ms 48716 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 57 ms 28192 KB Output is correct
27 Correct 271 ms 91912 KB Output is correct
28 Correct 20 ms 28236 KB Output is correct
29 Correct 30 ms 28264 KB Output is correct
30 Correct 23 ms 28264 KB Output is correct
31 Correct 27 ms 28264 KB Output is correct
32 Correct 11 ms 11728 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 13 ms 28216 KB Output is correct
35 Correct 14 ms 28268 KB Output is correct
36 Correct 707 ms 108392 KB Output is correct
37 Correct 703 ms 108608 KB Output is correct
38 Correct 671 ms 108248 KB Output is correct
39 Correct 665 ms 108044 KB Output is correct
40 Correct 673 ms 108100 KB Output is correct
41 Correct 246 ms 108036 KB Output is correct
42 Correct 670 ms 108364 KB Output is correct
43 Correct 689 ms 108288 KB Output is correct
44 Correct 697 ms 108484 KB Output is correct
45 Correct 662 ms 108224 KB Output is correct
46 Correct 653 ms 108468 KB Output is correct
47 Correct 643 ms 107844 KB Output is correct
48 Correct 657 ms 108100 KB Output is correct
49 Correct 659 ms 108140 KB Output is correct
50 Correct 6 ms 10060 KB Output is correct
51 Correct 7 ms 10132 KB Output is correct
52 Correct 6 ms 10060 KB Output is correct
53 Incorrect 6 ms 10060 KB Output isn't correct
54 Halted 0 ms 0 KB -

Subtask #8
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9688 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9740 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 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9720 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 169 ms 92032 KB Output is correct
23 Correct 50 ms 48812 KB Output is correct
24 Correct 40 ms 48716 KB Output is correct
25 Correct 33 ms 28236 KB Output is correct
26 Correct 57 ms 28192 KB Output is correct
27 Correct 271 ms 91912 KB Output is correct
28 Correct 20 ms 28236 KB Output is correct
29 Correct 30 ms 28264 KB Output is correct
30 Correct 23 ms 28264 KB Output is correct
31 Correct 27 ms 28264 KB Output is correct
32 Correct 11 ms 11728 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 13 ms 28216 KB Output is correct
35 Correct 14 ms 28268 KB Output is correct
36 Correct 707 ms 108392 KB Output is correct
37 Correct 703 ms 108608 KB Output is correct
38 Correct 671 ms 108248 KB Output is correct
39 Correct 665 ms 108044 KB Output is correct
40 Correct 673 ms 108100 KB Output is correct
41 Correct 246 ms 108036 KB Output is correct
42 Correct 670 ms 108364 KB Output is correct
43 Correct 689 ms 108288 KB Output is correct
44 Correct 697 ms 108484 KB Output is correct
45 Correct 662 ms 108224 KB Output is correct
46 Correct 653 ms 108468 KB Output is correct
47 Correct 643 ms 107844 KB Output is correct
48 Correct 657 ms 108100 KB Output is correct
49 Correct 659 ms 108140 KB Output is correct
50 Correct 6 ms 10060 KB Output is correct
51 Correct 7 ms 10132 KB Output is correct
52 Correct 6 ms 10060 KB Output is correct
53 Incorrect 6 ms 10060 KB Output isn't correct
54 Halted 0 ms 0 KB -