Submission #3642289
Source Code Expand
n=int(input()) words=[] gm='YES' rep='YES' for i in range(n): c=input() words.append((len(c),c)) for i in range(n-1): a=words[i][1] b=words[i+1][1] if b[0]==a[len(a)-1]: gm='YES' continue else: gm='NO' break words=sorted(words) for i in range(n-1): if words[i][0]==words[i+1][0]: if words[i][1]==words[i+1][1]: rep='NO' break if rep=='YES'and gm=='YES': print(rep) else: print('NO')
Submission Info
Submission Time | |
---|---|
Task | B - Shiritori |
User | vjudge4 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 483 Byte |
Status | WA |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | All | Sample | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 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 | WA | 17 ms | 3064 KB |
max_2 | WA | 17 ms | 3064 KB |
max_3 | WA | 17 ms | 3064 KB |
max_4 | WA | 17 ms | 3064 KB |
min_1 | WA | 17 ms | 3064 KB |
no1_1 | WA | 17 ms | 3064 KB |
no1_2 | WA | 17 ms | 3064 KB |
no2_1 | WA | 17 ms | 3064 KB |
no2_2 | WA | 17 ms | 3064 KB |
random_1 | WA | 17 ms | 3064 KB |
random_2 | WA | 17 ms | 3064 KB |
sample_01 | WA | 17 ms | 3064 KB |
sample_02 | WA | 17 ms | 3064 KB |
sample_03 | WA | 17 ms | 3064 KB |
sample_04 | WA | 17 ms | 3064 KB |
yes_1 | WA | 17 ms | 3064 KB |
yes_2 | WA | 17 ms | 3064 KB |