oj.uz

Submission #519425

# Submission time Handle Problem Language Result Execution time Memory
519425 2022-01-26T10:48:29 Z AmShZ Newspapers (CEOI21_newspapers) C++11
100 / 100
 72 ms 5808 KB 
//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(u);
			vec.push_back(v);
		}
		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
12.0 / 12.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 0 ms 344 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 0 ms 336 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 ms 352 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 472 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 1 ms 472 KB Output is correct
20 Correct 1 ms 484 KB Output is correct

Subtask #3
80.0 / 80.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 0 ms 344 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 0 ms 336 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 352 KB Output is correct
66 Correct 0 ms 332 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 0 ms 332 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 1 ms 332 KB Output is correct
74 Correct 1 ms 332 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 1 ms 336 KB Output is correct
77 Correct 1 ms 344 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 1 ms 352 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 332 KB Output is correct
82 Correct 1 ms 460 KB Output is correct
83 Correct 1 ms 332 KB Output is correct
84 Correct 1 ms 348 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 Correct 1 ms 332 KB Output is correct
90 Correct 1 ms 332 KB Output is correct
91 Correct 1 ms 332 KB Output is correct
92 Correct 1 ms 332 KB Output is correct
93 Correct 1 ms 332 KB Output is correct
94 Correct 1 ms 332 KB Output is correct
95 Correct 2 ms 332 KB Output is correct
96 Correct 1 ms 332 KB Output is correct
97 Correct 1 ms 332 KB Output is correct
98 Correct 1 ms 332 KB Output is correct
99 Correct 1 ms 332 KB Output is correct
100 Correct 1 ms 332 KB Output is correct
101 Correct 1 ms 332 KB Output is correct
102 Correct 1 ms 332 KB Output is correct
103 Correct 2 ms 332 KB Output is correct
104 Correct 1 ms 332 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 2 ms 332 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 332 KB Output is correct
109 Correct 1 ms 332 KB Output is correct
110 Correct 1 ms 332 KB Output is correct
111 Correct 1 ms 332 KB Output is correct
112 Correct 1 ms 332 KB Output is correct
113 Correct 1 ms 344 KB Output is correct
114 Correct 1 ms 332 KB Output is correct
115 Correct 1 ms 332 KB Output is correct
116 Correct 1 ms 332 KB Output is correct
117 Correct 1 ms 332 KB Output is correct
118 Correct 1 ms 332 KB Output is correct
119 Correct 1 ms 332 KB Output is correct
120 Correct 1 ms 336 KB Output is correct
121 Correct 1 ms 332 KB Output is correct
122 Correct 1 ms 332 KB Output is correct
123 Correct 1 ms 332 KB Output is correct
124 Correct 1 ms 332 KB Output is correct
125 Correct 1 ms 332 KB Output is correct
126 Correct 1 ms 332 KB Output is correct
127 Correct 1 ms 332 KB Output is correct
128 Correct 1 ms 332 KB Output is correct
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 348 KB Output is correct
133 Correct 1 ms 332 KB Output is correct
134 Correct 20 ms 1476 KB Output is correct
135 Correct 15 ms 1540 KB Output is correct
136 Correct 39 ms 4372 KB Output is correct
137 Correct 21 ms 2728 KB Output is correct
138 Correct 34 ms 3252 KB Output is correct
139 Correct 62 ms 5808 KB Output is correct
140 Correct 10 ms 1096 KB Output is correct
141 Correct 4 ms 588 KB Output is correct
142 Correct 60 ms 4632 KB Output is correct
143 Correct 72 ms 4456 KB Output is correct
144 Correct 1 ms 472 KB Output is correct
145 Correct 1 ms 460 KB Output is correct