Codeforces Round #486 (Div. 3) (B. Substrings Sort)

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    map<string,ll>mp;

    map<string,ll>::iterator it;

    vector<string>vec[109];

    ll n,k=0,flag=0;

    cin>>n;

    string str[n+2],ans[n+2];

    for(ll i=0; i<n; i++) cin>>str[i];

    for(ll i=1; i<=109; i++)

        for(ll j=0; j<n; j++)

            if(str[j].size()==i)

                ans[k++]=str[j];

    if(k==n)

    {

        for(ll i=0; i<k-1; i++)

        {

            string a=ans[i],b=ans[i+1];

            ll cnt=0;

            for(ll j=0; j<b.size(); j++)

            {

                if(b[j]==a[0])

                {

                    for(ll k=0,l=j; k<a.size(); k++,l++)

                    {

                        if(b[l]==a[k])

                            cnt++;

                        else break;

                    }

                }

                if(cnt==a.size())

                {

                    flag++;

                    break;

                }

                else cnt=0;

            }

        }

        if(flag==(n-1))

        {

            cout<<"YES"<<endl;

            for(ll i=0; i<n; i++)

                cout<<ans[i]<<endl;

        }

        else cout<<"NO"<<endl;

    }

    else

        cout<<"NO"<<endl;

    return 0;

}

///Alhamdulillah

Problem Link: https://codeforces.com/contest/988/problem/B