oj.uz

Submission #1114867

# Submission time Handle Problem Language Result Execution time Memory
1114867 2024-11-19T17:25:31 Z MisterReaper Newspapers (CEOI21_newspapers) C++17
100 / 100
 52 ms 8264 KB 
#include <bits/stdc++.h>

using i64 = long long;

#ifdef DEBUG 
    #include "/home/ahmetalp/Desktop/Workplace/debug.h"
#else
    #define debug(...) void(23)
#endif

constexpr int max_N = int(1000) + 5;

int N, M;
std::vector<int> adj[max_N];

void solve_seperated_diameter_local() {
    for (int n = 1; n <= 10; ++n) {
        std::vector<int> dp(1 << n, -1);
        dp[0] = 0;
        auto dfs = [&](auto&& self, int mask) -> int {
            if (dp[mask] != -1) {
                return dp[mask] == -2 ? n : dp[mask];
            } 
            dp[mask] = -2;
            int ans = n + 100;
            for (int i = 0; i < n; ++i) {
                int nmask = 0;
                for (int j = 0; j < n; ++j) {
                    if (mask >> j & 1 && i != j) {
                        if (j - 1 >= 0) nmask |= (1 << (j - 1));
                        if (j + 1 < n) nmask |= (1 << (j + 1));
                    }
                }
                ans = std::min(ans, self(self, nmask) + 1);
            }
            return dp[mask] = ans;
        };
        int ans = dfs(dfs, (1 << n) - 1);
        std::cout << n << ' ' << ans << '\n';
    }
}

std::vector<int> find_diameter() {
    std::vector<int> dist(N);
    auto dfs = [&](auto&& self, int v, int pr) -> void {
        for (auto u : adj[v]) {
            if (u == pr) {
                continue;
            }
            dist[u] = dist[v] + 1;
            self(self, u, v);
        }
    };
    dfs(dfs, 0, 0);
    int root = std::max_element(dist.begin(), dist.end()) - dist.begin();
    dist.assign(N, 0);
    dfs(dfs, root, root);
    root = std::max_element(dist.begin(), dist.end()) - dist.begin();
    dist.assign(N, 0);
    dfs(dfs, root, root);
    int leaf = std::max_element(dist.begin(), dist.end()) - dist.begin();
    std::vector<int> stk;
    auto find = [&](auto&& self, int v, int pr) -> void {
        stk.emplace_back(v);
        if (v == leaf) {
            return;
        }
        for (auto u : adj[v]) {
            if (u == pr) {
                continue;
            }
            self(self, u, v);
            if (stk.back() == leaf) {
                return;
            }
        }
        stk.pop_back();
    };
    find(find, root, root);

    return stk;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    // solve_seperated_diameter_local();

    std::cin >> N >> M;
    for (int i = 0; i < M; ++i) {
        int A, B;
        std::cin >> A >> B;
        --A, --B;
        adj[A].emplace_back(B);
        adj[B].emplace_back(A);
    }

    if (M != N - 1) {
        std::cout << "NO\n";
        return 0;
    }

    auto dia = find_diameter();

    std::queue<int> que;
    std::vector<int> dep(N, -1);
    for (auto u : dia) {
        dep[u] = 0;
        que.emplace(u);
    }
    while (!que.empty()) {
        int v = que.front();
        que.pop();
        for (auto u : adj[v]) {
            if (dep[u] != -1) {
                continue;
            }
            dep[u] = dep[v] + 1;
            que.emplace(u);
        }
    }

    for (int i = 0; i < N; ++i) {
        if (dep[i] >= 3) {
            std::cout << "NO\n";
            return 0;
        }
    }

    if (N == 1) {
        std::cout << "YES\n1\n1\n";
        return 0;
    } 

    dep[dia.front()] = -1;

    int root = dia[1];
    std::vector<int> ans, par(N, -1);
    auto dfs = [&](auto&& self, int v) -> int {
        debug(v);
        if (adj[v].size() == 0) {
            return 0;
        }
        int t = 0, save_child = -1;
        ans.emplace_back(v);
        std::vector<int> w;
        for (auto u : adj[v]) {
            par[u] = v;
            adj[u].erase(std::find(adj[u].begin(), adj[u].end(), v));
            if (dep[u] == 1 && !adj[u].empty()) {
                w.emplace_back(u);
            } else if (dep[u] == 0) {
                save_child = u;
            }
        }
        for (auto u : w) {
            ans.emplace_back(u);
            ans.emplace_back(v);
        }
        if (save_child != -1) {
            self(self, save_child);
        }
        ans.emplace_back(v);
        for (auto u : w) {
            ans.emplace_back(u);
            ans.emplace_back(v);
        }
        return t;
    };
    dfs(dfs, root);

    std::cout << "YES\n";
    std::cout << ans.size() << '\n';
    for (auto u : ans) {
        std::cout << u + 1 << ' ';
    }
    std::cout << '\n';

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 504 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 508 KB Output is correct
22 Correct 1 ms 480 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 504 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 2 ms 336 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 504 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 508 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 2 ms 484 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 592 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 504 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 508 KB Output is correct
22 Correct 1 ms 480 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 504 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 2 ms 336 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 504 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 508 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 2 ms 484 KB Output is correct
65 Correct 1 ms 592 KB Output is correct
66 Correct 1 ms 336 KB Output is correct
67 Correct 1 ms 484 KB Output is correct
68 Correct 1 ms 336 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 1 ms 336 KB Output is correct
73 Correct 1 ms 336 KB Output is correct
74 Correct 1 ms 336 KB Output is correct
75 Correct 1 ms 336 KB Output is correct
76 Correct 1 ms 336 KB Output is correct
77 Correct 1 ms 336 KB Output is correct
78 Correct 1 ms 336 KB Output is correct
79 Correct 1 ms 336 KB Output is correct
80 Correct 1 ms 336 KB Output is correct
81 Correct 1 ms 336 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 1 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 1 ms 336 KB Output is correct
86 Correct 1 ms 336 KB Output is correct
87 Correct 1 ms 376 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 592 KB Output is correct
90 Correct 1 ms 592 KB Output is correct
91 Correct 1 ms 592 KB Output is correct
92 Correct 1 ms 592 KB Output is correct
93 Correct 1 ms 592 KB Output is correct
94 Correct 1 ms 592 KB Output is correct
95 Correct 1 ms 592 KB Output is correct
96 Correct 2 ms 592 KB Output is correct
97 Correct 1 ms 592 KB Output is correct
98 Correct 2 ms 592 KB Output is correct
99 Correct 2 ms 592 KB Output is correct
100 Correct 1 ms 592 KB Output is correct
101 Correct 1 ms 592 KB Output is correct
102 Correct 1 ms 592 KB Output is correct
103 Correct 1 ms 592 KB Output is correct
104 Correct 1 ms 592 KB Output is correct
105 Correct 1 ms 760 KB Output is correct
106 Correct 1 ms 592 KB Output is correct
107 Correct 1 ms 592 KB Output is correct
108 Correct 1 ms 492 KB Output is correct
109 Correct 2 ms 592 KB Output is correct
110 Correct 1 ms 764 KB Output is correct
111 Correct 1 ms 592 KB Output is correct
112 Correct 1 ms 592 KB Output is correct
113 Correct 2 ms 760 KB Output is correct
114 Correct 1 ms 592 KB Output is correct
115 Correct 1 ms 592 KB Output is correct
116 Correct 1 ms 592 KB Output is correct
117 Correct 1 ms 592 KB Output is correct
118 Correct 1 ms 592 KB Output is correct
119 Correct 1 ms 592 KB Output is correct
120 Correct 1 ms 592 KB Output is correct
121 Correct 1 ms 592 KB Output is correct
122 Correct 1 ms 760 KB Output is correct
123 Correct 1 ms 592 KB Output is correct
124 Correct 1 ms 592 KB Output is correct
125 Correct 1 ms 592 KB Output is correct
126 Correct 1 ms 592 KB Output is correct
127 Correct 1 ms 592 KB Output is correct
128 Correct 1 ms 760 KB Output is correct
129 Correct 1 ms 336 KB Output is correct
130 Correct 1 ms 336 KB Output is correct
131 Correct 1 ms 336 KB Output is correct
132 Correct 1 ms 336 KB Output is correct
133 Correct 1 ms 336 KB Output is correct
134 Correct 13 ms 2128 KB Output is correct
135 Correct 9 ms 2140 KB Output is correct
136 Correct 23 ms 5456 KB Output is correct
137 Correct 15 ms 2640 KB Output is correct
138 Correct 33 ms 4848 KB Output is correct
139 Correct 42 ms 8016 KB Output is correct
140 Correct 7 ms 1616 KB Output is correct
141 Correct 3 ms 592 KB Output is correct
142 Correct 39 ms 7496 KB Output is correct
143 Correct 52 ms 8264 KB Output is correct
144 Correct 1 ms 592 KB Output is correct
145 Correct 1 ms 592 KB Output is correct