Submission #3556131
Source Code Expand
#include<iostream> #include<cmath> #include<cstdlib> #include<string> #include<algorithm> #include<vector> #include<map> int main() { int N; std::cin >> N; std::map<std::string, int> map; bool flg = true; std::string tmp; char last; for (int i = 0; i < N; i++) { std::cin >> tmp; if (map[tmp] == 1) flg = false; else map[tmp] = 1; if (i == 0); else if (last != tmp[0]) flg = false; last = tmp[tmp.size()-1]; } if (flg == false) std::cout << "No" << std::endl; else std::cout << "Yes" << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Shiritori |
User | redultimate |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 610 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 |