Submission #3598466
Source Code Expand
N = int(input()) S1 = input() S2 = input() ans = 0 i = 0 if S1[0] == S2[0]: ans = 3 i = 1 else: ans = 6 i = 2 while(i < len(S1)): if S1[i] == S2[i]: if S1[i - 1] == S2[i - 1]: ans *= 2 ans %= (10 ** 9 + 7) i += 1 else: if S1[i - 1] != S2[i - 1]: ans *= 3 ans %= (10 ** 9 + 7) else: ans *= 2 ans %= (10 ** 9 + 7) i += 2 print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Coloring Dominoes |
User | shinya1999 |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 490 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1.txt | AC | 17 ms | 3064 KB |
10.txt | AC | 17 ms | 3064 KB |
11.txt | AC | 17 ms | 3064 KB |
12.txt | AC | 17 ms | 3064 KB |
13.txt | AC | 17 ms | 3064 KB |
14.txt | AC | 17 ms | 3064 KB |
15.txt | AC | 17 ms | 3064 KB |
16.txt | AC | 17 ms | 3064 KB |
17.txt | AC | 17 ms | 3064 KB |
18.txt | AC | 17 ms | 3064 KB |
19.txt | AC | 17 ms | 3064 KB |
2.txt | AC | 17 ms | 3064 KB |
20.txt | AC | 17 ms | 3064 KB |
21.txt | AC | 17 ms | 3064 KB |
22.txt | AC | 17 ms | 3064 KB |
3.txt | AC | 17 ms | 3064 KB |
4.txt | AC | 17 ms | 3064 KB |
5.txt | AC | 17 ms | 3064 KB |
6.txt | AC | 17 ms | 3064 KB |
7.txt | AC | 17 ms | 3064 KB |
8.txt | AC | 17 ms | 3064 KB |
9.txt | AC | 17 ms | 3064 KB |
sample1.txt | AC | 17 ms | 3064 KB |
sample2.txt | AC | 17 ms | 3064 KB |
sample3.txt | AC | 17 ms | 3064 KB |