Submission #3556146


Source Code Expand

#include <bits/stdc++.h>
using namespace std;


int main() {
    long long n;
    cin >> n;
    string s[n];
    long long i;
    map<string,int> mp;
    bool ok = true;
    for(i=0;i<n;i++)
    {
        cin >> s[i];
        if(mp.find(s[i]) != mp.end())
        {
            ok = false;
            break;
        }
        if(i == 0)
            mp[s[i]]++;
        else
        {
            if(s[i][0] != s[i-1][s[i-1].length()-1])
            {
                ok = false;
                break;
            }
            mp[s[i]]++;
            
        }
    }
    cout <<(ok ? "Yes": "No");
	return 0;
}

Submission Info

Submission Time
Task B - Shiritori
User redultimate
Language C++14 (GCC 5.4.1)
Score 200
Code Size 649 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All Sample
Score / Max Score 200 / 200 0 / 0
Status
AC × 17
AC × 4
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