Task: | Ositus |
Sender: | T |
Submission time: | 2021-10-17 20:07:50 +0300 |
Language: | Python3 (CPython3) |
Status: | READY |
Result: | 65 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 40 |
#2 | ACCEPTED | 25 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.06 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.11 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.10 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.10 s | 1, 2, 3 | details |
#5 | ACCEPTED | 0.46 s | 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
# Datatahti 2022 alku # Ositus (Partitioning) # @author TRS MOD = 1000000007 MX = 1000001 partitions = [0] * MX appeared = [False] * MX def partitioning(s): s = "." + s partitions[0] = 1 for i in range(1, len(s)): appeared = [False] * MX for j in range(i, 0, -1): if (appeared[ord(s[j]) - ord('a')]): break appeared[ord(s[j]) - ord('a')] = True partitions[i] += partitions[j - 1] partitions[i] %= MOD s = input() if (len(s) == 1): print(1) else: partitioning(s) print(partitions[len(s)])
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
a |
correct output |
---|
1 |
user output |
---|
1 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
abcdefghij |
correct output |
---|
512 |
user output |
---|
512 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
abcabaacbc |
correct output |
---|
120 |
user output |
---|
120 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
aaxxxxxxaa |
correct output |
---|
4 |
user output |
---|
4 |
Test 5
Group: 2, 3
Verdict: ACCEPTED
input |
---|
mfyzvoxmppoxcvktmcjkryyocfweub... |
correct output |
---|
643221148 |
user output |
---|
643221148 |
Test 6
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
weinscqmmpgbrlboocvtbptgbahmwv... |
correct output |
---|
831644159 |
user output |
---|
(empty) |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
sxaoxcyrjoeieyinaqxwukgzdnhhsw... |
correct output |
---|
816016015 |
user output |
---|
(empty) |