Submission #4024782
Source Code Expand
from collections import defaultdict A = input() Alphabet = defaultdict(int) for i in range(len(A)): Alphabet[A[i]] += 1 Total = (len(A) - 1) * len(A) // 2 + 1 for key in Alphabet: if Alphabet[key] > 1: double = (Alphabet[key] - 1) * Alphabet[key] // 2 Total -= double print(Total)
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | earlgrey_yh |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 316 Byte |
Status | AC |
Exec Time | 58 ms |
Memory | 3872 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 21 ms | 3316 KB |
sample_02.txt | AC | 21 ms | 3316 KB |
sample_03.txt | AC | 21 ms | 3316 KB |
subtask_1_01.txt | AC | 21 ms | 3316 KB |
subtask_1_02.txt | AC | 52 ms | 3872 KB |
subtask_1_03.txt | AC | 21 ms | 3316 KB |
subtask_1_04.txt | AC | 21 ms | 3316 KB |
subtask_1_05.txt | AC | 21 ms | 3316 KB |
subtask_1_06.txt | AC | 21 ms | 3316 KB |
subtask_1_07.txt | AC | 24 ms | 3316 KB |
subtask_1_08.txt | AC | 56 ms | 3868 KB |
subtask_1_09.txt | AC | 55 ms | 3744 KB |
subtask_1_10.txt | AC | 52 ms | 3744 KB |
subtask_1_11.txt | AC | 51 ms | 3868 KB |
subtask_1_12.txt | AC | 52 ms | 3740 KB |
subtask_1_13.txt | AC | 54 ms | 3868 KB |
subtask_1_14.txt | AC | 51 ms | 3872 KB |
subtask_1_15.txt | AC | 55 ms | 3872 KB |
subtask_1_16.txt | AC | 58 ms | 3872 KB |
subtask_1_17.txt | AC | 54 ms | 3872 KB |