Submission #1946069
Source Code Expand
eval"N,M,Q,*A="+`dd`.split*?,;
Z=0,-1,0,1;
S=->h{v=[];A.map{|a|14.times{v[a]=1;a+=M}};(0...h).count{|k|!v[k]&&(*u=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&&u<<i
}while k=u.pop;
1)}};
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 | 290 |
| Code Size | 268 Byte |
| Status | TLE |
| Exec Time | 1061 ms |
| Memory | 37768 KB |
Judge Result
| Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | Subtask4 | ||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 100 | 90 / 90 | 200 / 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 | 12 ms | 2048 KB |
| sub0_in2.txt | AC | 9 ms | 2044 KB |
| sub1_in1.txt | AC | 8 ms | 2044 KB |
| sub1_in2.txt | AC | 8 ms | 2044 KB |
| sub1_in3.txt | AC | 9 ms | 2044 KB |
| sub1_in4.txt | AC | 9 ms | 2044 KB |
| sub1_in5.txt | TLE | 1060 ms | 27640 KB |
| sub2_in1.txt | AC | 293 ms | 37768 KB |
| sub3_in1.txt | AC | 364 ms | 27140 KB |
| sub3_in2.txt | AC | 311 ms | 20064 KB |
| sub4_in1.txt | TLE | 1060 ms | 27204 KB |
| sub4_in2.txt | TLE | 1061 ms | 16664 KB |