Submission #3769103

---

Source Code Expand

#include<stdio.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<string>
#include<math.h>
#include <numeric>

using namespace std;
typedef long long ll;

#define REP(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl

const ll mod = 1e9 + 7;
const ll inf = 1e18;

void printVector(vector<ll> A){
    cout << "[vector]" << endl;
    for(int i=0; i<A.size(); i++){
        cout << A[i] << " ";
    }
    cout << endl;
}

char getLastWord(string s){
    return s[s.length() - 1];
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    // input
    int N;
    cin >> N;

    vector<string> W;
    FOR(i, 0, N){
        string s;
        cin >> s;
        W.push_back(s);
    }

    set<string> S;
    for(auto w : W){
        S.insert(w);
    }

    bool ret = true;
    if(W.size() != S.size()){
        ret = false;
    }
    else{
        char lastWord = getLastWord(W[0]);
        FOR(i, 1, N){
            if(W[i][0] != lastWord){
                ret = false;
            }
            lastWord = getLastWord(W[i]);
        }
    }

    if(ret){
        p("Yes");
    }else{
        p("No");
    }
    
    return 0;
}

Submission Info

Judge Result