Submission #3152567


Source Code Expand

#
# File    : B.rb
# Author  : Kazune Takahashi
# Created : 2018-9-8 21:01:53
# Powered by Visual Studio Code
#

n = gets.to_i
w = []
n.times{
  w << gets.chomp
}
dic = {}
dic[w[0]] = true
for i in 0...(n-1)
  if dic[w[i+1]].nil? && w[i][-1] == w[i+1][0]
    dic[w[i+1]] = true
  else
    puts "No"
    exit
  end
end
puts "Yes"

Submission Info

Submission Time
Task B - Shiritori
User kazunetakahashi
Language Ruby (2.3.3)
Score 200
Code Size 352 Byte
Status AC
Exec Time 8 ms
Memory 3836 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 7 ms 1788 KB
max_2 AC 7 ms 1788 KB
max_3 AC 8 ms 1788 KB
max_4 AC 7 ms 1788 KB
min_1 AC 7 ms 1788 KB
no1_1 AC 7 ms 1788 KB
no1_2 AC 7 ms 1788 KB
no2_1 AC 7 ms 1788 KB
no2_2 AC 7 ms 1788 KB
random_1 AC 7 ms 1788 KB
random_2 AC 7 ms 1788 KB
sample_01 AC 7 ms 1788 KB
sample_02 AC 7 ms 1788 KB
sample_03 AC 7 ms 1788 KB
sample_04 AC 7 ms 1788 KB
yes_1 AC 8 ms 3836 KB
yes_2 AC 7 ms 1788 KB