Submission #3013744
Source Code Expand
s = input() t = input() q = int(input()) sa_pre = [s[i] == "A" for i in range(len(s))] ta_pre = [t[i] == "A" for i in range(len(t))] sa = [0, sa_pre[0]] ta = [0, ta_pre[0]] for i in range(1, len(s)): sa.append(sa[-1] + sa_pre[i]) for i in range(1, len(t)): ta.append(ta[-1] + ta_pre[i]) def check(a, b, c, d): xa = sa[b] - sa[a - 1] ya = ta[d] - ta[c - 1] if (2 * xa - (b - a + 1)) % 3 == (2 * ya - (d - c + 1)) % 3: print("YES") return else: print("NO") return for _ in range(q): a, b, c, d = map(int, input().split()) check(a, b, c, d)
Submission Info
Submission Time | |
---|---|
Task | E - TrBBnsformBBtion |
User | anagohirame |
Language | PyPy3 (2.4.0) |
Score | 600 |
Code Size | 587 Byte |
Status | AC |
Exec Time | 1199 ms |
Memory | 59772 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt |
All | 0_000.txt, 0_001.txt, bound_0.txt, bound_1.txt, bound_2.txt, bound_3.txt, min.txt, rnd_10000_10.txt, rnd_10000_10000.txt, rnd_10000_2.txt, rnd_10_10.txt, rnd_10_10000.txt, rnd_10_2.txt, rnd_2_10.txt, rnd_2_10000.txt, rnd_2_2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 166 ms | 38256 KB |
0_001.txt | AC | 168 ms | 38384 KB |
bound_0.txt | AC | 1087 ms | 59772 KB |
bound_1.txt | AC | 1086 ms | 57980 KB |
bound_2.txt | AC | 1097 ms | 57980 KB |
bound_3.txt | AC | 1103 ms | 58108 KB |
min.txt | AC | 166 ms | 38256 KB |
rnd_10000_10.txt | AC | 1115 ms | 58364 KB |
rnd_10000_10000.txt | AC | 1168 ms | 59452 KB |
rnd_10000_2.txt | AC | 1131 ms | 58316 KB |
rnd_10_10.txt | AC | 1131 ms | 59268 KB |
rnd_10_10000.txt | AC | 1197 ms | 58244 KB |
rnd_10_2.txt | AC | 1125 ms | 58244 KB |
rnd_2_10.txt | AC | 1142 ms | 58236 KB |
rnd_2_10000.txt | AC | 1199 ms | 59132 KB |
rnd_2_2.txt | AC | 1135 ms | 58108 KB |