답안 #970849

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970849	2024-04-27T11:27:39 Z	marvinthang	Newspapers (CEOI21_newspapers)	C++17	100 / 100	1 ms	1012 KB

newspapers

/*************************************
*    author: marvinthang             *
*    created: 27.04.2024 18:08:42    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	int n, m; cin >> n >> m;
	if (n == 1) return void(cout << "YES\n1\n1\n");
	if (n == 2) return void(cout << "YES\n2\n1 1\n");
	if (m != n - 1) return void(cout << "NO\n");
	vector <vector <int>> adj(n);
	REP(i, m) {
		int u, v; cin >> u >> v; --u; --v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	vector <int> dist(n), par(n);
	auto bfs = [&] (int s) {
		fill(ALL(dist), -1);
		dist[s] = 0;
		queue <int> q;
		q.push(s);
		while (!q.empty()) {
			int u = q.front(); q.pop();
			for (int v: adj[u]) if (dist[v] == -1) {
				dist[v] = dist[u] + 1;
				par[v] = u;
				q.push(v);
			}
		}
		return max_element(ALL(dist)) - dist.begin();
	};
	int a = bfs(0);
	int b = bfs(a);
	vector <int> path;
	while ((b = par[b]) != a) path.push_back(b);
	vector <int> res;
	REP(i, path.size()) {
		int u = path[i];
		res.push_back(u);
		if (i && i + 1 < (int) path.size()) {
			for (int v: adj[u]) if (v != path[i - 1] && v != path[i + 1] && (int) adj[v].size() > 1) {
				for (int w: adj[v]) if (w != u && (int) adj[w].size() > 1) return void(cout << "NO\n");
				res.push_back(v);
				res.push_back(u);
			}
		}
	}
	int sz = res.size();
	res.resize(sz + sz);
	reverse_copy(res.begin(), res.begin() + sz, res.begin() + sz);
	cout << "YES\n" << res.size() << '\n';
	for (int x: res) cout << x + 1 << ' ';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("newspapers");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
newspapers.cpp:97:2: note: in expansion of macro 'file'
   97 |  file("newspapers");
      |  ^~~~
newspapers.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
newspapers.cpp:97:2: note: in expansion of macro 'file'
   97 |  file("newspapers");
      |  ^~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
80.0 / 80.0

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

답안 #970849

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 8.0 / 8.0

Subtask #3 80.0 / 80.0

Subtask #1
12.0 / 12.0

Subtask #2
8.0 / 8.0

Subtask #3
80.0 / 80.0