Submission #1946018
Source Code Expand
eval"N,M,Q,*A="+`dd`.split*?,; Z=0,-1,0,1; D=->k{V[k]||4.times{|d|V[k]=d; i=7*(k/7+Z[d])+j=k%7+Z[~d]; i<0||j<0||i<H&&j<7&&D[i] }}; S=->_{V=[];A.map{|a|14.times{V[a]=1;a+=M}};(0...H).count{|k|!V[k]&D[k]}}; x=S[H=M.lcm(7)]; p~-N*7/H*(S[H*=2]-x)+x
Submission Info
Submission Time | |
---|---|
Task | C - Calendar 2 |
User | akouryy |
Language | Ruby (2.3.3) |
Score | 90 |
Code Size | 252 Byte |
Status | RE |
Exec Time | 508 ms |
Memory | 39312 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | Subtask4 | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 90 / 90 | 0 / 200 | 0 / 110 | ||||||||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sub0_in1.txt, sub0_in2.txt |
Subtask1 | sub0_in1.txt, sub0_in2.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt |
Subtask2 | sub2_in1.txt |
Subtask3 | sub2_in1.txt, sub3_in1.txt, sub3_in2.txt |
Subtask4 | sub0_in1.txt, sub0_in2.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub2_in1.txt, sub3_in1.txt, sub3_in2.txt, sub4_in1.txt, sub4_in2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sub0_in1.txt | AC | 10 ms | 1920 KB |
sub0_in2.txt | AC | 8 ms | 2044 KB |
sub1_in1.txt | AC | 8 ms | 2044 KB |
sub1_in2.txt | AC | 8 ms | 2044 KB |
sub1_in3.txt | AC | 8 ms | 2044 KB |
sub1_in4.txt | AC | 9 ms | 2044 KB |
sub1_in5.txt | RE | 51 ms | 32260 KB |
sub2_in1.txt | AC | 322 ms | 39312 KB |
sub3_in1.txt | AC | 508 ms | 38272 KB |
sub3_in2.txt | RE | 45 ms | 30340 KB |
sub4_in1.txt | RE | 66 ms | 34980 KB |
sub4_in2.txt | RE | 46 ms | 26376 KB |