답안 #576896

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
576896	2022-06-13T17:53:18 Z	tengiz05	Newspapers (CEOI21_newspapers)	C++17	54 / 100	2 ms	468 KB

newspapers

#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

int main() {
    int n, m;
    cin >> n >> m;
    
    if (n == 1) {
        cout << "YES\n";
        cout << "1\n";
        cout << "1\n";
        return 0;
    }
    if (n == 2) {
        cout << "YES\n";
        cout << "2\n";
        cout << "1 1\n";
        return 0;
    }
    
    if (m >= n) {
        cout << "NO\n";
        return 0;
    }
    
    vector<vector<int>> adj(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    vector<int> dep(n);
    
    pair<int, int> mx{-1, -1};
    
    function<void(int, int)> dfs = [&](int u, int p) {
        mx = max(mx, pair(dep[u], u));
        for (int v : adj[u]) {
            if (v != p) {
                dep[v] = dep[u] + 1;
                dfs(v, u);
            }
        }
    };
    
    dfs(0, -1);
    
    int last = mx.second;
    
    mx = {-1, -1};
    dep[last] = 0;
    dfs(last, -1);
    
    int u = mx.second;
    
    vector<int> g;
    function<bool(int, int)> dfs2 = [&](int u, int p) {
        if (u == last) {
            g.push_back(u);
            return true;
        }
        for (int v : adj[u]) {
            if (v != p && dfs2(v, u)) {
                g.push_back(u);
                return true;
            }
        }
        return false;
    };
    
    dfs2(u, -1);
    
    int p = g.size() / 2;
    u = g[p];
    int l = -1, r = -1;
    if (p > 0) {
        l = g[p - 1];
    }
    if (p < int(g.size()) - 1) {
        r = g[p + 1];
    }
    
    vector<int> mxdep(n), par(n);
    dfs = [&](int u, int p) {
        par[u] = p;
        mxdep[u] = u;
        for (int v : adj[u]) {
            if (v != p) {
                dep[v] = dep[u] + 1;
                dfs(v, u);
                if (dep[mxdep[v]] > dep[mxdep[u]]) {
                    mxdep[u] = mxdep[v];
                }
            }
        }
    };
    
    dep[u] = 0;
    dfs(u, -1);
    
    for (int i = 0; i < n; i++) {
        int c = 0;
        for (int v : adj[i]) {
            if (dep[mxdep[v]] - dep[i] >= 3) {
                c++;
            }
        }
        if (c >= 3) {
            cout << "NO\n";
            return 0;
        }
    }
    
    std::vector<int> a;
    
    int s = -1;
    
    dfs = [&](int u, int p) {
        for (int v : adj[u]) {
            if (v != p && adj[v].size() > 1) {
                dfs(v, u);
            }
        }
        if (s == -1) {
            s = u;
        }
    };
    
    for (int &v : adj[u]) {
        if (v == l) {
            swap(v, adj[u][0]);
        }
        if (v == r) {
            swap(v, adj[u].back());
        }
    }
    
    dfs(u, -1);
    
    int lst = -1;
    
    dfs = [&](int u, int p) {
        a.push_back(u);
        lst = u;
        for (int v : adj[u]) {
            if (v != p && adj[v].size() > 1 && dep[v] > dep[u]) {
                dfs(v, u);
                a.push_back(u);
            }
        }
        for (int v : adj[u]) {
            if (v != p && adj[v].size() > 1 && dep[v] < dep[u]) {
                dfs(v, u);
                a.push_back(u);
            }
        }
    };
    
    dfs(s, -1);
    
    while (a.back() != lst)
        a.pop_back();
    
    cout << "YES\n";
    cout << 2 * a.size() << "\n";
    for (int x : a) {
        cout << x + 1 << " ";
    }
    reverse(a.begin(), a.end());
    for (int x : a) {
        cout << x + 1 << " ";
    }
    cout << "\n";
}

Subtask #1
6.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	0 ms	296 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	304 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	304 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	252 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	300 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
40	Correct	0 ms	300 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
44	Correct	1 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
49	Correct	0 ms	212 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	300 KB	Output is correct
53	Correct	1 ms	212 KB	Output is correct
54	Correct	0 ms	212 KB	Output is correct
55	Correct	1 ms	212 KB	Output is correct
56	Correct	0 ms	212 KB	Output is correct
57	Correct	1 ms	212 KB	Output is correct
58	Correct	0 ms	296 KB	Output is correct
59	Correct	0 ms	212 KB	Output is correct
60	Correct	0 ms	212 KB	Output is correct
61	Correct	0 ms	212 KB	Output is correct
62	Correct	1 ms	212 KB	Output is correct
63	Correct	1 ms	212 KB	Output is correct
64	Correct	0 ms	300 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	300 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	304 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	304 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	2 ms	428 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	432 KB	Output is correct
20	Correct	1 ms	468 KB	Output is correct

Subtask #3
40.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	0 ms	296 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	304 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	304 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	252 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	300 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
40	Correct	0 ms	300 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
44	Correct	1 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
49	Correct	0 ms	212 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	300 KB	Output is correct
53	Correct	1 ms	212 KB	Output is correct
54	Correct	0 ms	212 KB	Output is correct
55	Correct	1 ms	212 KB	Output is correct
56	Correct	0 ms	212 KB	Output is correct
57	Correct	1 ms	212 KB	Output is correct
58	Correct	0 ms	296 KB	Output is correct
59	Correct	0 ms	212 KB	Output is correct
60	Correct	0 ms	212 KB	Output is correct
61	Correct	0 ms	212 KB	Output is correct
62	Correct	1 ms	212 KB	Output is correct
63	Correct	1 ms	212 KB	Output is correct
64	Correct	0 ms	300 KB	Output is correct
65	Correct	0 ms	212 KB	Output is correct
66	Correct	0 ms	212 KB	Output is correct
67	Correct	0 ms	212 KB	Output is correct
68	Correct	1 ms	300 KB	Output is correct
69	Correct	0 ms	212 KB	Output is correct
70	Correct	1 ms	296 KB	Output is correct
71	Correct	1 ms	212 KB	Output is correct
72	Correct	0 ms	212 KB	Output is correct
73	Correct	0 ms	304 KB	Output is correct
74	Correct	1 ms	212 KB	Output is correct
75	Correct	1 ms	212 KB	Output is correct
76	Correct	1 ms	212 KB	Output is correct
77	Correct	0 ms	212 KB	Output is correct
78	Correct	0 ms	212 KB	Output is correct
79	Correct	1 ms	340 KB	Output is correct
80	Correct	1 ms	340 KB	Output is correct
81	Correct	1 ms	340 KB	Output is correct
82	Correct	1 ms	300 KB	Output is correct
83	Correct	1 ms	340 KB	Output is correct
84	Correct	1 ms	340 KB	Output is correct
85	Correct	1 ms	340 KB	Output is correct
86	Correct	1 ms	308 KB	Output is correct
87	Correct	1 ms	340 KB	Output is correct
88	Correct	1 ms	340 KB	Output is correct
89	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
90	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
91	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
92	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
93	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
94	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
95	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
96	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
97	Partially correct	1 ms	308 KB	Failed to provide a successful strategy.
98	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
99	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
100	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
101	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
102	Partially correct	2 ms	340 KB	Failed to provide a successful strategy.
103	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
104	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
105	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
106	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
107	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
108	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
109	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
110	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
111	Partially correct	1 ms	304 KB	Failed to provide a successful strategy.
112	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
113	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
114	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
115	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
116	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
117	Partially correct	2 ms	340 KB	Failed to provide a successful strategy.
118	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
119	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
120	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
121	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
122	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
123	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
124	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
125	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
126	Partially correct	1 ms	300 KB	Failed to provide a successful strategy.
127	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
128	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
129	Correct	1 ms	340 KB	Output is correct
130	Correct	1 ms	340 KB	Output is correct
131	Correct	1 ms	340 KB	Output is correct
132	Correct	1 ms	340 KB	Output is correct
133	Correct	1 ms	340 KB	Output is correct
134	Correct	1 ms	316 KB	Output is correct
135	Correct	0 ms	340 KB	Output is correct
136	Correct	0 ms	312 KB	Output is correct
137	Correct	1 ms	340 KB	Output is correct
138	Correct	0 ms	340 KB	Output is correct
139	Correct	1 ms	340 KB	Output is correct
140	Correct	1 ms	340 KB	Output is correct
141	Correct	1 ms	308 KB	Output is correct
142	Correct	1 ms	316 KB	Output is correct
143	Correct	0 ms	340 KB	Output is correct
144	Correct	1 ms	436 KB	Output is correct
145	Correct	1 ms	428 KB	Output is correct

답안 #576896

Compilation message

Subtask #1 6.0 / 12.0

Subtask #2 8.0 / 8.0

Subtask #3 40.0 / 80.0

Subtask #1
6.0 / 12.0

Subtask #2
8.0 / 8.0

Subtask #3
40.0 / 80.0