Submission #519412

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
519412	2022-01-26T10:28:47 Z	AmShZ	Newspapers (CEOI21_newspapers)	C++11	54 / 100	69 ms	5804 KB

newspapers

//khodaya khodet komak kon
# include <bits/stdc++.h>

using namespace std;

typedef long long                                        ll;
typedef long double                                      ld;
typedef pair <int, int>                                  pii;
typedef pair <pii, int>                                  ppi;
typedef pair <int, pii>                                  pip;
typedef pair <pii, pii>                                  ppp;
typedef pair <ll, ll>                                    pll;

# define A                                               first
# define B                                               second
# define endl                                            '\n'
# define sep                                             ' '
# define all(x)                                          x.begin(), x.end()
# define kill(x)                                         return cout << x << endl, 0
# define SZ(x)                                           int(x.size())
# define lc                                              id << 1
# define rc                                              id << 1 | 1
# define fast_io                                         ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));}

const int xn = 1e3 + 10;
const int xm = - 20 + 10;
const int sq = 320;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const ld eps = 1e-15;
const int mod = 998244353;
const int base = 257;

int n, m, H[xn], rt1, rt2, P[xn];
vector <int> adj[xn], masir, vec, ans;
bool mark[xn], flag;

void DFS(int v, int p = - 1){
	P[v] = p;
	mark[v] = true;
	for (int u : adj[v]){
		if (mark[u]){
			flag |= u != p;
			continue;
		}
		H[u] = H[v] + 1;
		DFS(u, v);
	}
}
void DFS2(int v, int p = - 1){
	flag |= 2 < H[v];
	for (int u : adj[v]){
		if (mark[u] || u == p)
			continue;
		if (mark[v] && 1 < SZ(adj[u])){
			vec.push_back(v);
			vec.push_back(u);
		}
		H[u] = H[v] + 1;
		DFS2(u, v);
	}
}

int main(){
	fast_io;

	cin >> n >> m;
	for (int i = 1; i <= m; ++ i){
		int v, u;
		cin >> v >> u;
		adj[v].push_back(u);
		adj[u].push_back(v);
	}
	if (n <= 2){
		cout << "YES\n";
		cout << n << endl;
		for (int i = 1; i <= n; ++ i)
			cout << 1 << sep;
		cout << endl;
		return 0;
	}
	DFS(1);
	if (flag)
		kill("NO");
	for (int i = 1; i <= n; ++ i)
		if (H[rt1] < H[i])
			rt1 = i;
	H[rt1] = 0;
	fill(mark, mark + n + 1, false);
	DFS(rt1);
	for (int i = 1; i <= n; ++ i)
		if (H[rt2] < H[i])
			rt2 = i;
	fill(mark, mark + n + 1, false);
	rt2 = P[rt2];
	while (rt2 != rt1){
		masir.push_back(rt2);
		rt2 = P[rt2];
	}
	for (int v : masir)
		mark[v] = true;
	for (int v : masir){
		vec.push_back(v);
		H[v] = 0;
		DFS2(v);
		if (flag)
			kill("NO");
	}
	for (int x : vec)
		ans.push_back(x);
	reverse(all(vec));
	for (int x : vec)
		ans.push_back(x);
	cout << "YES\n";
	cout << SZ(ans) << endl;
	for (int x : ans)
		cout << x << sep;
	cout << endl;
	

	return 0;
}

Subtask #1
6.0 / 12.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
40.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
9	Correct	1 ms	336 KB	Output is correct
10	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
11	Correct	1 ms	332 KB	Output is correct
12	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
13	Correct	0 ms	332 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	336 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	0 ms	332 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
24	Correct	1 ms	332 KB	Output is correct
25	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
26	Partially correct	0 ms	460 KB	Failed to provide a successful strategy.
27	Partially correct	0 ms	332 KB	Failed to provide a successful strategy.
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
31	Correct	1 ms	332 KB	Output is correct
32	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
33	Partially correct	0 ms	336 KB	Failed to provide a successful strategy.
34	Correct	1 ms	332 KB	Output is correct
35	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
36	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
37	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
38	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
39	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
40	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
41	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
42	Partially correct	0 ms	332 KB	Failed to provide a successful strategy.
43	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
44	Partially correct	0 ms	336 KB	Failed to provide a successful strategy.
45	Correct	1 ms	332 KB	Output is correct
46	Correct	0 ms	332 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Partially correct	0 ms	332 KB	Failed to provide a successful strategy.
49	Correct	1 ms	336 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
52	Correct	1 ms	336 KB	Output is correct
53	Correct	1 ms	340 KB	Output is correct
54	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
55	Correct	0 ms	332 KB	Output is correct
56	Correct	0 ms	332 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	1 ms	344 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	336 KB	Output is correct
61	Correct	1 ms	332 KB	Output is correct
62	Correct	1 ms	332 KB	Output is correct
63	Correct	0 ms	332 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct
65	Correct	1 ms	332 KB	Output is correct
66	Correct	1 ms	332 KB	Output is correct
67	Correct	1 ms	332 KB	Output is correct
68	Correct	1 ms	332 KB	Output is correct
69	Correct	1 ms	344 KB	Output is correct
70	Correct	1 ms	332 KB	Output is correct
71	Correct	1 ms	340 KB	Output is correct
72	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
73	Correct	0 ms	336 KB	Output is correct
74	Partially correct	0 ms	332 KB	Failed to provide a successful strategy.
75	Correct	1 ms	332 KB	Output is correct
76	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
77	Correct	1 ms	332 KB	Output is correct
78	Correct	1 ms	332 KB	Output is correct
79	Correct	1 ms	336 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	344 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	340 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	1 ms	332 KB	Failed to provide a successful strategy.
95	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
96	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
97	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
98	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
99	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
100	Partially correct	1 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	1 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	348 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	2 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	1 ms	332 KB	Failed to provide a successful strategy.
118	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
119	Partially correct	1 ms	332 KB	Failed to provide a successful strategy.
120	Partially correct	1 ms	332 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	332 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	332 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	332 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	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	340 KB	Output is correct
132	Correct	1 ms	332 KB	Output is correct
133	Correct	1 ms	332 KB	Output is correct
134	Correct	14 ms	1432 KB	Output is correct
135	Correct	12 ms	1564 KB	Output is correct
136	Correct	35 ms	4420 KB	Output is correct
137	Correct	24 ms	2656 KB	Output is correct
138	Correct	34 ms	3268 KB	Output is correct
139	Correct	66 ms	5804 KB	Output is correct
140	Correct	9 ms	1092 KB	Output is correct
141	Correct	3 ms	596 KB	Output is correct
142	Correct	69 ms	4524 KB	Output is correct
143	Correct	66 ms	4528 KB	Output is correct
144	Correct	1 ms	460 KB	Output is correct
145	Correct	1 ms	472 KB	Output is correct

Submission #519412

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