Submission #4062334
Source Code Expand
#include <iostream> #include <set> using namespace std; int main() { int N; cin >> N; string W[N]; for (int i = 0; i < N; i++) cin >> W[i]; set<string> st; st.insert(W[0]); char last = W[0].at(W[0].length() - 1); string ans = "Yes"; for (int i = 1; i < N; i++) { if (st.find(W[i]) != st.end()) ans = "No"; if (last != W[i].at(0)) ans = "No"; st.insert(W[i]); last = W[i].at(W[i].length() - 1); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Shiritori |
User | parsee1053 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 511 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | Sample | ||||
---|---|---|---|---|---|---|
Score / Max Score | 200 / 200 | 0 / 0 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | max_1, max_2, max_3, max_4, min_1, no1_1, no1_2, no2_1, no2_2, random_1, random_2, sample_01, sample_02, sample_03, sample_04, yes_1, yes_2 |
Sample | sample_01, sample_02, sample_03, sample_04 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
max_1 | AC | 1 ms | 256 KB |
max_2 | AC | 1 ms | 256 KB |
max_3 | AC | 1 ms | 256 KB |
max_4 | AC | 1 ms | 256 KB |
min_1 | AC | 1 ms | 256 KB |
no1_1 | AC | 1 ms | 256 KB |
no1_2 | AC | 1 ms | 256 KB |
no2_1 | AC | 1 ms | 256 KB |
no2_2 | AC | 1 ms | 256 KB |
random_1 | AC | 1 ms | 256 KB |
random_2 | AC | 1 ms | 256 KB |
sample_01 | AC | 1 ms | 256 KB |
sample_02 | AC | 1 ms | 256 KB |
sample_03 | AC | 1 ms | 256 KB |
sample_04 | AC | 1 ms | 256 KB |
yes_1 | AC | 1 ms | 256 KB |
yes_2 | AC | 1 ms | 256 KB |