1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
#include <bits/stdc++.h>
inline int read() {
static const int IN_LEN = 1000000;
static char buf[IN_LEN], *h, *t;
if (h == t) {
t = (h = buf) + fread(buf, 1, IN_LEN, stdin);
if (h == t) return -1;
}
return *h++;
}
template<class T>
inline bool read(T &x) {
static bool iosig = 0;
static char c;
for (iosig = 0, c = read(); !isdigit(c); c = read()) {
if (c == -1) return false;
if (c == '-') iosig = 1;
}
for (x = 0; isdigit(c); c = read())
x = (x + (x << 2) << 1) + (c ^ '0');
if (iosig) x = -x;
return true;
}
inline int read(char *s) {
register char c = read();
register int len = 0;
for (; !(c == '0' || c == '1' || c == '?'); c = read());
for (; c == '0' || c == '1' || c == '?'; s[++len] = c, c = read());
s[++len] = 0;
return len - 1;
}
#define long long long
namespace TwoSat {
const int MAXN = 4000005;
std::vector<int> edge[MAXN];
inline void addEdge(const int u, const int v) {
edge[u].push_back(v);
}
int idx;
int dfn[MAXN], low[MAXN];
int inComponent[MAXN], cnt;
std::stack<int> st;
inline void tarjan(int u) {
dfn[u] = low[u] = ++idx, st.push(u);
for (auto v : edge[u]) {
if (!dfn[v]) tarjan(v), low[u] = std::min(low[u], low[v]);
else if (!inComponent[v]) low[u] = std::min(low[u], dfn[v]);
}
if (low[u] == dfn[u]) {
cnt++;
register int v;
do {
v = st.top(), st.pop();
inComponent[v] = cnt;
} while (u != v);
}
}
}
namespace Trie {
const int MAXN = 1000005;
int pos[MAXN << 1];
struct Node {
Node *next[2], *fa;
Node(Node *fa = NULL) : fa(fa) {}
inline void *operator new(size_t);
} pool[MAXN], *cur = pool, *root;
inline void *Node::operator new(size_t) {
return cur++;
}
inline void insert(const char *s, const int len, const int id) {
Node *p = root;
for (register int i = 1; i <= len; i++) {
register int t = (s[i] == '1');
if (!p->next[t]) p->next[t] = new Node(p);
p = p->next[t];
}
Trie::pos[id] = p - pool;
}
inline void init() {
root = new Node();
}
}
namespace Task {
const int MAXN = 1000005;
std::vector<int> last[MAXN];
int n, tot;
int blank[MAXN], ans[MAXN];
char s[MAXN << 1];
int len;
char *str[TwoSat::MAXN];
inline void init() {
Trie::init();
char *s = Task::s;
read(n);
for (register int i = 0; i < n; i++) {
len = read(str[i] = s);
s = str[i] + len + 1, *s = '\n';
register int t = 0;
for (register int j = 1; j <= len; j++) if (str[i][j] == '?') t = j;
blank[i] = t;
if (!t) {
Trie::insert(str[i], len, i << 1);
Trie::pos[i << 1 | 1] = Trie::pos[i << 1];
TwoSat::addEdge(i << 1, i << 1 | 1);
} else {
str[i][t] = '0';
Trie::insert(str[i], len, i << 1);
str[i][t] = '1';
Trie::insert(str[i], len, i << 1 | 1);
}
}
}
inline void build() {
tot = n << 1;
for (Trie::Node *p = Trie::root; p != Trie::cur; p++) {
if (p->next[0]) {
TwoSat::addEdge(tot + ((p - Trie::pool) << 1), tot +
((p->next[0] - Trie::pool) << 1));
TwoSat::addEdge(tot + ((p->next[0] - Trie::pool) << 1 | 1),
tot + ((p - Trie::pool) << 1 | 1));
}
if (p->next[1]) {
TwoSat::addEdge(tot + ((p - Trie::pool) << 1), tot +
((p->next[1] - Trie::pool) << 1));
TwoSat::addEdge(tot + ((p->next[1] - Trie::pool) << 1 | 1),
tot + ((p - Trie::pool) << 1 | 1));
}
}
for (register int i = 0; i < (n << 1); i++) {
last[Trie::pos[i]].push_back(i);
if (Trie::pool[Trie::pos[i]].next[0]) {
TwoSat::addEdge(i, tot + ((Trie::pool[Trie::pos[i]].next[0] -
Trie::pool) << 1));
}
if (Trie::pool[Trie::pos[i]].next[1]) {
TwoSat::addEdge(i, tot + ((Trie::pool[Trie::pos[i]].next[1] -
Trie::pool) << 1));
}
TwoSat::addEdge(i, tot + ((Trie::pool[Trie::pos[i]].fa -
Trie::pool) << 1 | 1));
TwoSat::addEdge(tot + (Trie::pos[i] << 1), i ^ 1);
TwoSat::addEdge(tot + (Trie::pos[i] << 1 | 1), i ^ 1);
}
register int ncnt = Trie::cur - Trie::pool;
tot = tot + (ncnt << 1);
for (register int i = 0; i < ncnt; i++) {
if (last[i].size() > 1) {
register int tmp = tot;
for (register int j = 0; j < last[i].size(); j++) {
TwoSat::addEdge(tmp + j, last[i][j] ^ 1);
if (j - 1 >= 0)
TwoSat::addEdge(tmp + j, tmp + j - 1);
}
tmp += last[i].size();
for (register int j = 0; j < last[i].size(); j++) {
TwoSat::addEdge(tmp + j, last[i][j] ^ 1);
if (j + 1 < last[i].size())
TwoSat::addEdge(tmp + j, tmp + j + 1);
}
for (register int j = 0; j < last[i].size(); j++) {
if (j - 1 >= 0)
TwoSat::addEdge(last[i][j], tot + j - 1);
if (j + 1 < last[i].size())
TwoSat::addEdge(last[i][j], tmp + j + 1);
}
tot += 2 * last[i].size();
}
}
}
inline void solve() {
init();
build();
for (register int i = 0; i < tot; i++)
if (!TwoSat::dfn[i])
TwoSat::tarjan(i);
for (register int i = 0; i < n; i++)
if (TwoSat::inComponent[i << 1] == TwoSat::inComponent[i << 1 | 1])
printf("NO\n"), exit(0);
else
ans[i] = TwoSat::inComponent[i << 1] <
TwoSat::inComponent[i << 1 | 1] ? 0 : 1;
for (register int i = 0; i < n; i++)
if (blank[i])
str[i][blank[i]] = '0' + ans[i];
printf("YES\n");
printf("%s", Task::s + 1);
}
}
extern int optimizedMain(void) __asm__ ("optimizedMain");
int optimizedMain() {
Task::solve();
exit(0);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
#endif
int size = 80 << 20;
char *p = (char *)malloc(size) + size;
__asm__ __volatile__(
"movq %0, %%rsp\n"
"pushq $exit\n"
"jmp optimizedMain\n"
:: "r"(p));
return 0;
}
|
