답안 #881965

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
881965	2023-12-02T10:49:47 Z	TAhmed33	Newspapers (CEOI21_newspapers)	C++	60 / 100	147 ms	26836 KB

newspapers

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 25;
vector <int> adj[MAXN];
int n, m;
int dfs (int pos, int par, int dep = 0) {
	if (dep == 3) {
		return 1;
	}
	int cnt = 0;
	for (auto j : adj[pos]) if (j != par) cnt += dfs(j, pos, dep + 1);
	if (!dep) return cnt;
	return cnt >= 1;
}
int dist[1 << 21];
pair <int, int> par[1 << 21];
queue <int> cur;
const int inf = 1e9;
int adjmask[1 << 21];
int main () {
	cin >> n >> m;
	bool flag = 1;
	for (int i = 1; i <= m; i++) {
		int a, b;
		cin >> a >> b;
		if (a > b) swap(a, b);
		flag &= a + 1 == b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	if (m != n - 1) {
		cout << "NO\n";
		return 0;
	}
	if (flag) {
		cout << "YES\n";
		if (n == 1) {
			cout << "1\n1\n";
			return 0;
		}
		if (n == 2) {
			cout << "2\n2 2\n";
			return 0;
		}
		cout << 2 * (n - 2) << '\n';
		for (int i = 2; i < n; i++) cout << i << " ";
		for (int i = n - 1; i >= 2; i--) cout << i << " ";
		cout << '\n';
		return 0;
	}
	if (n <= 20) {
		for (int i = 1; i <= n; i++) {
			for (auto j : adj[i]) {
				adjmask[i] += 1 << j;
			}
		}
		for (auto &i : dist) i = inf;
		dist[(1 << (n + 1)) - 2] = 0;
		cur.push((1 << (n + 1)) - 2);
		par[(1 << (n + 1)) - 2].first = -1;
		while (!cur.empty()) {
			auto k = cur.front();
			cur.pop();
			vector <int> t;
			for (int i = 1; i <= n; i++) {
				if (k & (1 << i)) {
					t.push_back(i);
				}
			}
			for (auto i : t) {
				int newmask = 0;
				for (auto j : t) {
					if (j == i) continue;
					newmask |= adjmask[j];
				}
				if (dist[newmask] == inf) {
					dist[newmask] = 1 + dist[k];
					par[newmask].first = k;
					par[newmask].second = i;
					cur.push(newmask);
				}
			}
		}
		if (dist[0] == inf) {
			cout << "NO\n";
			return 0;
		}
		cout << "YES\n";
		vector <int> ret;
		int mask = 0;
		while (mask != (1 << (n + 1)) - 2) {
			ret.push_back(par[mask].second);
			mask = par[mask].first;
		}
		reverse(ret.begin(), ret.end());
		cout << (int)ret.size() << '\n';
		for (auto i : ret) cout << i << " ";
		cout << '\n';
		return 0;
	}
	for (int i = 1; i <= n; i++) {
		if (dfs(i, -1) >= 3) {
			cout << "NO\n"; return 0;
		}
	}
	cout << "YES\n";
	cout << "1\n1\n";
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	4 ms	12380 KB	Output is correct
6	Correct	2 ms	12380 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	3 ms	12632 KB	Output is correct
9	Correct	3 ms	12380 KB	Output is correct
10	Correct	3 ms	12380 KB	Output is correct
11	Correct	2 ms	12380 KB	Output is correct
12	Correct	3 ms	12380 KB	Output is correct
13	Correct	3 ms	12380 KB	Output is correct
14	Correct	3 ms	12376 KB	Output is correct
15	Correct	3 ms	12380 KB	Output is correct
16	Correct	3 ms	12380 KB	Output is correct
17	Correct	3 ms	12508 KB	Output is correct
18	Correct	3 ms	12380 KB	Output is correct
19	Correct	3 ms	12380 KB	Output is correct
20	Correct	4 ms	12380 KB	Output is correct
21	Correct	3 ms	12380 KB	Output is correct
22	Correct	3 ms	12380 KB	Output is correct
23	Correct	3 ms	12380 KB	Output is correct
24	Correct	3 ms	12380 KB	Output is correct
25	Correct	3 ms	12380 KB	Output is correct
26	Correct	3 ms	12380 KB	Output is correct
27	Correct	3 ms	12380 KB	Output is correct
28	Correct	3 ms	12380 KB	Output is correct
29	Correct	3 ms	12508 KB	Output is correct
30	Correct	3 ms	12512 KB	Output is correct
31	Correct	3 ms	14428 KB	Output is correct
32	Correct	3 ms	14428 KB	Output is correct
33	Correct	3 ms	14428 KB	Output is correct
34	Correct	3 ms	14492 KB	Output is correct
35	Correct	3 ms	14428 KB	Output is correct
36	Correct	3 ms	14580 KB	Output is correct
37	Correct	3 ms	14428 KB	Output is correct
38	Correct	3 ms	14428 KB	Output is correct
39	Correct	3 ms	14428 KB	Output is correct
40	Correct	3 ms	14428 KB	Output is correct
41	Correct	3 ms	14428 KB	Output is correct
42	Correct	3 ms	14424 KB	Output is correct
43	Correct	3 ms	14680 KB	Output is correct
44	Correct	3 ms	14428 KB	Output is correct
45	Correct	3 ms	14428 KB	Output is correct
46	Correct	3 ms	14428 KB	Output is correct
47	Correct	3 ms	16476 KB	Output is correct
48	Correct	3 ms	16476 KB	Output is correct
49	Correct	3 ms	16476 KB	Output is correct
50	Correct	3 ms	16476 KB	Output is correct
51	Correct	4 ms	20572 KB	Output is correct
52	Correct	3 ms	16476 KB	Output is correct
53	Correct	4 ms	20572 KB	Output is correct
54	Correct	3 ms	20572 KB	Output is correct
55	Correct	4 ms	26716 KB	Output is correct
56	Correct	4 ms	24668 KB	Output is correct
57	Correct	4 ms	26836 KB	Output is correct
58	Correct	4 ms	24664 KB	Output is correct
59	Correct	1 ms	2396 KB	Output is correct
60	Correct	1 ms	2648 KB	Output is correct
61	Correct	1 ms	2648 KB	Output is correct
62	Correct	1 ms	2392 KB	Output is correct
63	Correct	1 ms	2392 KB	Output is correct
64	Correct	1 ms	2396 KB	Output is correct

Subtask #2

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2392 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2648 KB	Output is correct
20	Correct	1 ms	2528 KB	Output is correct

Subtask #3

40.0 / 80.0

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