Submission #75697686

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)

using namespace std;
const int N=2e6+10;
int n,m,tot,ch[N][2];
bool flg[N];
string s;
void dfs(int u,int d){
    if(d==m)return;
    int l=ch[u][0],r=ch[u][1];
    if(l)dfs(l,d+1);
    if(r)dfs(r,d+1);
    flg[u]=(l&&r&&flg[l]&&flg[r]);
    return;
}
signed main(){
	  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>m;rep(i,1,n){
        cin>>s;int u=0;
        rep(j,0,m-1){
            int c=(s[j]=='0');
            if(!ch[u][c])ch[u][c]=++tot;
            u=ch[u][c];
        }
        flg[u]=1;
    }
    dfs(0,0);if(flg[0])return cout<<"No\n",0;
    cout<<"Yes\n";int u=0;rep(i,1,m){
        if(u==-1){cout<<0;continue;}
        int l=ch[u][0],r=ch[u][1];
        if(!l||!flg[l])cout<<0,u=l?l:-1;
        else cout<<1,u=r?r:-1;
    }
	  cout<<"\n";
    return 0;
}

Submission Info

Judge Result