답안 #473967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
473967	2021-09-16T13:00:17 Z	model_code	Newspapers (CEOI21_newspapers)	C++17	50 / 100	262 ms	4540 KB

newspapers

#include <bits/stdc++.h>
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ll long long
 
using namespace std;
 
const int MAXN = 1010;
 
vector <int> ve[MAXN];
int bio[MAXN];
 
void impossible() {
    cout << "NO\n";
    exit(0);
}
 
void dfs(int x, int par) {
    bio[x] = bio[par] + 1;
 
    for (int y : ve[x]) {
        if (y == par) continue;
        if (bio[y]) impossible();
        dfs(y, x);
    }
 
    return;
}
 
int main_path[MAXN];
vector <int> path;
int twig[MAXN];
 
int rek(int x, int par) {
    int ma = 0;
    for (int y : ve[x]) {
        if (y == par) continue;
        if (main_path[y]) continue;
        ma = max(ma, rek(y, x));
    }
    if (ma == 3) impossible();
    twig[x] = ma;
    return ma + 1;
}
 
vector <int> out;
 
void print() {
    cout << "YES\n";
  if(out.size()>=2)out.pop_back();
    cout << out.size() << "\n";
    for (int x : out) cout << x + 1 << " ";
    cout << "\n";
 
    return;
}
 
int main() {
    int n, m;
    cin >> n >> m;
 
    if (n == 1) {
        out.push_back(0);
        print();
        return 0;
    }
 
    if (n == 2) {
        out.push_back(0);
        out.push_back(0);
        print();
        return 0;
    }
 
    REP(i, m) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        ve[a].push_back(b);
        ve[b].push_back(a);
    }
 
    dfs(0, 0);
    int A = -1, dist = -1;
    REP(i, n) {
        if (bio[i] > dist) {
            dist = bio[i];
            A = i;
        }
    }
 
    memset(bio, 0, sizeof bio);
    dfs(A, A);
    int B = -1;
    dist = -1;
    REP(i, n) {
        if (bio[i] > dist) {
            dist = bio[i];
            B = i;
        }
    }
 
    int x = B;
    while (x != A) {
        main_path[x] = 1;
        path.push_back(x);
        for (int y : ve[x]) {
            if (bio[y] == bio[x] - 1) {
                x = y;
                break;
            }
        }
    }
    path.push_back(A);
    main_path[A] = 1;
 
    memset(twig, 0, sizeof twig);
    REP(i, n) {
        if (main_path[i]) twig[i] = rek(i, i) - 1;
    }
 
    // remove first and last node of path to optimise
    if (path.size() > 1) {
        main_path[path[0]] = 0;
        path.erase(path.begin());
 
        twig[path[0]] = max(twig[path[0]], 1);
    }
    reverse(path.begin(), path.end());
    if (path.size() > 1) {
        main_path[path[0]] = 0;
        path.erase(path.begin());
 
        twig[path[0]] = max(twig[path[0]], 1);
    }
 
    for (int x : path) {
        out.push_back(x);
        if (twig[x] == 2) {
            for (int y : ve[x]) {
                if (main_path[y] || twig[y] == 0) continue;
                out.push_back(y);
                out.push_back(x);
            }
        }
    }
 
    reverse(path.begin(), path.end());
 
    for (int x : path) {
        out.push_back(x);
        if (twig[x] == 2) {
            for (int y : ve[x]) {
                if (main_path[y] || twig[y] == 0) continue;
                out.push_back(y);
                out.push_back(x);
            }
        }
    }
 
    print();
 
    return 0;
}

Subtask #1

6.0 / 12.0

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

Subtask #2

4.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
3	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
4	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
7	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
8	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
9	Partially correct	0 ms	332 KB	Failed to provide a successful strategy.
10	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
11	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
12	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
13	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
14	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
15	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
16	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
17	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
18	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
19	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
20	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.

Subtask #3

40.0 / 80.0

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