Submission #19557704

---

Source Code Expand

#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
#include <iomanip>

using namespace std;

void b_shiritori2(void) {
	int n;
	cin >> n;
	vector<string>w(n);
	for (int i = 0; i < n; i++)cin >> w[i];

	for (int i = 1; i < n; i++) {
		bool is_ok = true;
		if (w[i][0] != w[i - 1][w[i - 1].size() - 1])is_ok = false;

		for (int j = 0; j < i; j++) {
			if (w[i] == w[j])is_ok = false;
		}

		if (!is_ok) {
			cout << "No" << endl;
			return;
		}
	}

	cout << "Yes" << endl;
}

int main()
{
    b_shiritori2();
    return 0;
}

Submission Info

Judge Result