Submission #1211740


Source Code Expand

Copy
S,T=[q=0,0].map{[q,*gets.chars.map{|c|q-=~c.count(?A)}]};gets;$<.map{|l|eval"A,B,C,D="+l.split*?,;puts (S[B]-S[A-1]-T[D]+T[C-1])%3<1?:YES: :NO}

Submission Info

Submission Time
Task E - TrBBnsformBBtion
User akouryy
Language Ruby (2.3.3)
Score 0
Code Size 143 Byte
Status
Exec Time 2109 ms
Memory 28620 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_000.txt, 0_001.txt
All 0 / 600 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 7 ms 1788 KB
0_001.txt 7 ms 1788 KB
bound_0.txt 2109 ms 26444 KB
bound_1.txt 2108 ms 28132 KB
bound_2.txt 2109 ms 26444 KB
bound_3.txt 2109 ms 26700 KB
min.txt 7 ms 1788 KB
rnd_10000_10.txt 2109 ms 26060 KB
rnd_10000_10000.txt 2108 ms 28620 KB
rnd_10000_2.txt 2109 ms 26188 KB
rnd_10_10.txt 2109 ms 26060 KB
rnd_10_10000.txt 2109 ms 26956 KB
rnd_10_2.txt 2109 ms 26956 KB
rnd_2_10.txt 2108 ms 27980 KB
rnd_2_10000.txt 2109 ms 26956 KB
rnd_2_2.txt 2109 ms 26828 KB