Submission #576766

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
576766	2022-06-13T12:18:07 Z	talant117408	Newspapers (CEOI21_newspapers)	C++17	54 / 100	76 ms	5064 KB

newspapers

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define long                unsigned long 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'

const int N = 1e3+3;
vector <int> graph[N];
int depth[N], furthest[N];
vector <int> diameter, tmp;
int df, vf, in_diameter[N];

void find_furthest(int v, int p, int dist) {
    tmp.pb(v);
    if (dist > df) {
        df = dist;
        vf = v;
        diameter = tmp;
    }
    for (auto to : graph[v]) {
        if (to == p) continue;
        find_furthest(to, v, dist+1);
    }
    tmp.pop_back();
}

int dfs(int v, int p) {
    int mx = depth[v];
    for (auto to : graph[v]) {
        if (to == p || in_diameter[to]) continue;
        depth[to] = depth[v] + 1;
        mx = max(mx, dfs(to, v));
    }
    furthest[v] = mx;
    return mx;
}

void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].pb(b);
        graph[b].pb(a);
    }
    
    if (m >= n) {
        cout << "NO" << endl;
        return;
    }
    
    find_furthest(1, 1, 0);
    df = 0;
    find_furthest(vf, vf, 0);
    df = 0;
    for (auto to : diameter) in_diameter[to] = 1;
    for (int i = 0; i < sz(diameter); i++) {
        auto to = diameter[i];
        dfs(to, to);
        if (furthest[to] >= 3 && i >= 3 && i <= n-4) {
            df++;
        }
    }
    if (df) {
        cout << "NO" << endl;
        return;
    }
    
    vector <int> order;
    for (int i = 1; i < sz(diameter)-1; i++) {
        order.pb(diameter[i]);
        for (auto to : graph[diameter[i]]) {
            if (to == diameter[i+1] || to == diameter[i-1] || sz(graph[to]) == 1) continue;
            order.pb(to); order.pb(to);
            order.pb(diameter[i]);
        }
    }
    reverse(all(diameter));
    for (int i = 1; i < sz(diameter)-1; i++) {
        order.pb(diameter[i]);
        for (auto to : graph[diameter[i]]) {
            if (to == diameter[i+1] || to == diameter[i-1] || sz(graph[to]) == 1) continue;
            order.pb(to); order.pb(to);
            order.pb(diameter[i]);
        }
    }
    
    cout << "YES" << endl;
    if (n == 1) {
        cout << "1\n1";
        return;
    }
    else if (n == 2) {
        cout << "2\n1 1";
        return;
    }
    cout << sz(order) << endl;
    for (auto to : order) cout << to << ' ';
}

int main() {
    do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}
/*
12 11
1 2
2 3
3 4
4 5
5 6
6 7
7 8
4 9
9 10
10 11
5 12
*/

Subtask #1

6.0 / 12.0

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

Subtask #2

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	480 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	468 KB	Output is correct
20	Correct	1 ms	468 KB	Output is correct

Subtask #3

40.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
9	Correct	0 ms	340 KB	Output is correct
10	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
11	Correct	0 ms	340 KB	Output is correct
12	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
24	Correct	0 ms	340 KB	Output is correct
25	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
26	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
27	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
31	Correct	0 ms	340 KB	Output is correct
32	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
33	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
34	Correct	0 ms	340 KB	Output is correct
35	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
36	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
37	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
38	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
39	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
40	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
41	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
42	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
43	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
44	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
45	Correct	0 ms	340 KB	Output is correct
46	Correct	0 ms	340 KB	Output is correct
47	Correct	0 ms	340 KB	Output is correct
48	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
49	Correct	0 ms	340 KB	Output is correct
50	Correct	0 ms	340 KB	Output is correct
51	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
52	Correct	0 ms	340 KB	Output is correct
53	Correct	1 ms	340 KB	Output is correct
54	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
55	Correct	0 ms	340 KB	Output is correct
56	Correct	0 ms	340 KB	Output is correct
57	Correct	0 ms	340 KB	Output is correct
58	Correct	0 ms	340 KB	Output is correct
59	Correct	1 ms	300 KB	Output is correct
60	Correct	0 ms	340 KB	Output is correct
61	Correct	0 ms	340 KB	Output is correct
62	Correct	0 ms	340 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct
64	Correct	1 ms	340 KB	Output is correct
65	Correct	0 ms	340 KB	Output is correct
66	Correct	0 ms	340 KB	Output is correct
67	Correct	0 ms	340 KB	Output is correct
68	Correct	0 ms	340 KB	Output is correct
69	Correct	0 ms	340 KB	Output is correct
70	Correct	0 ms	340 KB	Output is correct
71	Correct	1 ms	340 KB	Output is correct
72	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
73	Correct	0 ms	340 KB	Output is correct
74	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
75	Correct	0 ms	340 KB	Output is correct
76	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
77	Correct	0 ms	340 KB	Output is correct
78	Correct	0 ms	340 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	340 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	340 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	468 KB	Failed to provide a successful strategy.
90	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
91	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
92	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
93	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
94	Partially correct	1 ms	496 KB	Failed to provide a successful strategy.
95	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
96	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
97	Partially correct	2 ms	468 KB	Failed to provide a successful strategy.
98	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
99	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
100	Partially correct	1 ms	404 KB	Failed to provide a successful strategy.
101	Partially correct	2 ms	468 KB	Failed to provide a successful strategy.
102	Partially correct	1 ms	488 KB	Failed to provide a successful strategy.
103	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
104	Partially correct	2 ms	468 KB	Failed to provide a successful strategy.
105	Partially correct	2 ms	468 KB	Failed to provide a successful strategy.
106	Partially correct	2 ms	468 KB	Failed to provide a successful strategy.
107	Partially correct	2 ms	468 KB	Failed to provide a successful strategy.
108	Partially correct	2 ms	468 KB	Failed to provide a successful strategy.
109	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
110	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
111	Partially correct	1 ms	484 KB	Failed to provide a successful strategy.
112	Partially correct	1 ms	484 KB	Failed to provide a successful strategy.
113	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
114	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
115	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
116	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
117	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
118	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
119	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
120	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
121	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
122	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
123	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
124	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
125	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
126	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
127	Partially correct	1 ms	468 KB	Failed to provide a successful strategy.
128	Partially correct	1 ms	468 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	352 KB	Output is correct
134	Correct	16 ms	1544 KB	Output is correct
135	Correct	15 ms	1592 KB	Output is correct
136	Correct	33 ms	4044 KB	Output is correct
137	Correct	21 ms	2520 KB	Output is correct
138	Correct	37 ms	3404 KB	Output is correct
139	Correct	70 ms	5064 KB	Output is correct
140	Correct	9 ms	1228 KB	Output is correct
141	Correct	3 ms	744 KB	Output is correct
142	Correct	58 ms	4984 KB	Output is correct
143	Correct	76 ms	4940 KB	Output is correct
144	Correct	1 ms	468 KB	Output is correct
145	Correct	1 ms	488 KB	Output is correct