Submission #3771291
Source Code Expand
import java.lang.reflect.Array; import java.util.*; import java.util.regex.Matcher; import java.util.regex.Pattern; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in) ; int N = Integer.parseInt(scan.next()); String[] wordArray = new String[N]; for(int i = 0; i < N; i++){ wordArray[i] = scan.next(); } for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ if( (i != j) && wordArray[i].equals(wordArray[j])){ System.out.println("No"); return; } } } String end; String top; String a; for(int i = 0; i < N -1; i++){ end = wordArray[i].substring(wordArray[i].length()-1); top = wordArray[i+1].substring(0,1); if(end.equals(top) == false) { System.out.println("No"); return; } } System.out.println("Yes"); } }
Submission Info
Submission Time | |
---|---|
Task | B - Shiritori |
User | hndkzm |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 1131 Byte |
Status | AC |
Exec Time | 108 ms |
Memory | 21972 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 | 108 ms | 21716 KB |
max_2 | AC | 102 ms | 21844 KB |
max_3 | AC | 97 ms | 21716 KB |
max_4 | AC | 99 ms | 19028 KB |
min_1 | AC | 91 ms | 21972 KB |
no1_1 | AC | 95 ms | 19796 KB |
no1_2 | AC | 96 ms | 18772 KB |
no2_1 | AC | 91 ms | 19156 KB |
no2_2 | AC | 105 ms | 19028 KB |
random_1 | AC | 106 ms | 21204 KB |
random_2 | AC | 94 ms | 20564 KB |
sample_01 | AC | 90 ms | 21844 KB |
sample_02 | AC | 93 ms | 21844 KB |
sample_03 | AC | 92 ms | 20944 KB |
sample_04 | AC | 94 ms | 18900 KB |
yes_1 | AC | 99 ms | 19156 KB |
yes_2 | AC | 93 ms | 21844 KB |