Submission #4033315
Source Code Expand
#include <bits/stdc++.h> #define ll unsigned long long using namespace std; const int MOD = 1000000007; int main() { // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); int n; cin >> n; string s[2]; cin >> s[0] >> s[1]; ll res = (s[0][0] == s[1][0] ? 3 : 6); for(int i = s[0][0] == s[1][0] ? 1 : 2;i < n;){ if(s[0][i] == s[1][i]){ if(s[0][i - 1] == s[1][i - 1]){ res *= 2; } i++; }else{ if(s[0][i - 1] == s[1][i - 1]){ res *= 2; }else{ res *= 3; } i += 2; } res %= MOD; } cout << res; }
Submission Info
Submission Time | |
---|---|
Task | D - Coloring Dominoes |
User | Omar_Elawady |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 640 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
14.txt | AC | 1 ms | 256 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 1 ms | 256 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
2.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
3.txt | AC | 1 ms | 256 KB |
4.txt | AC | 1 ms | 256 KB |
5.txt | AC | 1 ms | 256 KB |
6.txt | AC | 1 ms | 256 KB |
7.txt | AC | 1 ms | 256 KB |
8.txt | AC | 1 ms | 256 KB |
9.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |