oj.uz

답안 #1114554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114554 2024-11-19T07:40:53 Z vjudge1 Newspapers (CEOI21_newspapers) C++17
54 / 100
 51 ms 4680 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.back()] = -1;

    int root = dia[dia.size() - 2];
    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) {
                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 (!w.empty()) ans.pop_back();
        if (save_child != -1) {
            self(self, save_child);
        }
        for (auto u : w) {
            ans.emplace_back(u);
            ans.emplace_back(v);
        }
        if (!w.empty()) ans.pop_back();
        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
6.0 / 12.0

# 결과 실행 시간 메모리 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 Partially correct 1 ms 336 KB Provide a successful but not optimal strategy.
6 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
7 Correct 1 ms 336 KB Output is correct
8 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
9 Correct 1 ms 336 KB Output is correct
10 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 336 KB Provide a successful but not optimal strategy.
15 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
21 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
22 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
23 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
24 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
25 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
26 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
27 Partially correct 1 ms 504 KB Failed to provide a successful strategy.
28 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
29 Correct 1 ms 336 KB Output is correct
30 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
31 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
32 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
33 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
34 Correct 1 ms 336 KB Output is correct
35 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
36 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
38 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
39 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
42 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
43 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
44 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
45 Correct 1 ms 336 KB Output is correct
46 Correct 1 ms 516 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
52 Correct 1 ms 508 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
55 Correct 1 ms 508 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 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 588 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 432 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 1 ms 620 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
40.0 / 80.0

# 결과 실행 시간 메모리 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 Partially correct 1 ms 336 KB Provide a successful but not optimal strategy.
6 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
7 Correct 1 ms 336 KB Output is correct
8 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
9 Correct 1 ms 336 KB Output is correct
10 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 336 KB Provide a successful but not optimal strategy.
15 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
21 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
22 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
23 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
24 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
25 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
26 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
27 Partially correct 1 ms 504 KB Failed to provide a successful strategy.
28 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
29 Correct 1 ms 336 KB Output is correct
30 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
31 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
32 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
33 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
34 Correct 1 ms 336 KB Output is correct
35 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
36 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
38 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
39 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
42 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
43 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
44 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
45 Correct 1 ms 336 KB Output is correct
46 Correct 1 ms 516 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
52 Correct 1 ms 508 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
55 Correct 1 ms 508 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 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 1 ms 512 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 1 ms 504 KB Output is correct
69 Partially correct 1 ms 336 KB Provide a successful but not optimal strategy.
70 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
71 Correct 1 ms 336 KB Output is correct
72 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
73 Correct 1 ms 504 KB Output is correct
74 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
75 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
76 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
77 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
78 Partially correct 2 ms 336 KB Provide a successful but not optimal strategy.
79 Correct 1 ms 508 KB Output is correct
80 Correct 1 ms 336 KB Output is correct
81 Correct 2 ms 504 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 2 ms 336 KB Output is correct
85 Correct 2 ms 336 KB Output is correct
86 Correct 1 ms 336 KB Output is correct
87 Correct 2 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Partially correct 2 ms 592 KB Failed to provide a successful strategy.
90 Partially correct 2 ms 764 KB Failed to provide a successful strategy.
91 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
92 Partially correct 2 ms 760 KB Failed to provide a successful strategy.
93 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
94 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
95 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
96 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
97 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
98 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
99 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
100 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
101 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
102 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
103 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
104 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
105 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
106 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
107 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
108 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
109 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
110 Partially correct 1 ms 764 KB Failed to provide a successful strategy.
111 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
112 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
113 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
114 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
115 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
116 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
117 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
118 Partially correct 1 ms 760 KB Failed to provide a successful strategy.
119 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
120 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
121 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
122 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
123 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
124 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
125 Partially correct 1 ms 760 KB Failed to provide a successful strategy.
126 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
127 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
128 Partially correct 1 ms 592 KB Failed to provide a successful strategy.
129 Correct 2 ms 336 KB Output is correct
130 Correct 1 ms 336 KB Output is correct
131 Correct 2 ms 336 KB Output is correct
132 Correct 2 ms 336 KB Output is correct
133 Correct 1 ms 336 KB Output is correct
134 Correct 11 ms 1360 KB Output is correct
135 Correct 9 ms 1360 KB Output is correct
136 Correct 22 ms 3912 KB Output is correct
137 Correct 20 ms 2216 KB Output is correct
138 Correct 23 ms 2896 KB Output is correct
139 Correct 43 ms 4680 KB Output is correct
140 Correct 7 ms 1104 KB Output is correct
141 Correct 3 ms 592 KB Output is correct
142 Correct 42 ms 4424 KB Output is correct
143 Correct 51 ms 4424 KB Output is correct
144 Correct 1 ms 592 KB Output is correct
145 Correct 2 ms 764 KB Output is correct