Submission #2840823
Source Code Expand
import string import re import datetime import calendar import collections import heapq import bisect import array import numpy as np a, b = map(int,input().split()) ans = np.empty((100, 100), dtype=int) x, y = ans.shape for i in range(x): for j in range(y): if j == 0: ans[i,j] = 1 elif j == y-1: ans[i,j] = 0 elif (i % 4) == 0 or (i % 4) == 1: ans[i,j] = 1 else: ans[i,j] = 0 def cut_b(): itr = 1 for i in range(2, x, 4): for j in range(2, y//2, 2): yield itr ans[i,j] = ans[i+1,j] = 1 itr+=1 def cut_w(): itr = 1 for i in range(0, x, 4): for j in range(-3, -y//2, -2): yield itr ans[i,j] = ans[i+1,j] = 0 itr+=1 for i in cut_b(): if i == a: break for i in cut_w(): if i == b: break print(100, 100) for i in range(x): for j in range(y): if ans[i,j] == 0: print('.', end="") else: print('#', end="") print()
Submission Info
Submission Time | |
---|---|
Task | D - Grid Components |
User | deoxy |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 1133 Byte |
Status | AC |
Exec Time | 180 ms |
Memory | 14444 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 180 ms | 14444 KB |
02.txt | AC | 176 ms | 14312 KB |
03.txt | AC | 175 ms | 14316 KB |
04.txt | AC | 176 ms | 14312 KB |
05.txt | AC | 177 ms | 14316 KB |
06.txt | AC | 176 ms | 14312 KB |
07.txt | AC | 176 ms | 14312 KB |
08.txt | AC | 174 ms | 14316 KB |
09.txt | AC | 175 ms | 13936 KB |
10.txt | AC | 177 ms | 13936 KB |
11.txt | AC | 177 ms | 14316 KB |
12.txt | AC | 175 ms | 14316 KB |
13.txt | AC | 176 ms | 14320 KB |
14.txt | AC | 177 ms | 14316 KB |
15.txt | AC | 175 ms | 14312 KB |
16.txt | AC | 174 ms | 14320 KB |
17.txt | AC | 178 ms | 14316 KB |
18.txt | AC | 177 ms | 14344 KB |
19.txt | AC | 176 ms | 14344 KB |
20.txt | AC | 175 ms | 14316 KB |
21.txt | AC | 174 ms | 14336 KB |
22.txt | AC | 173 ms | 14316 KB |
23.txt | AC | 179 ms | 14008 KB |
24.txt | AC | 175 ms | 14316 KB |
25.txt | AC | 176 ms | 14316 KB |
26.txt | AC | 177 ms | 14316 KB |
27.txt | AC | 175 ms | 14316 KB |
28.txt | AC | 176 ms | 14320 KB |
29.txt | AC | 177 ms | 14316 KB |
30.txt | AC | 174 ms | 14320 KB |
31.txt | AC | 176 ms | 14316 KB |
32.txt | AC | 177 ms | 14316 KB |
33.txt | AC | 180 ms | 14072 KB |
34.txt | AC | 177 ms | 14316 KB |
35.txt | AC | 175 ms | 14340 KB |
36.txt | AC | 177 ms | 14316 KB |
37.txt | AC | 176 ms | 14316 KB |
38.txt | AC | 175 ms | 14316 KB |
39.txt | AC | 179 ms | 14008 KB |
40.txt | AC | 177 ms | 14316 KB |
sample-01.txt | AC | 177 ms | 14008 KB |
sample-02.txt | AC | 175 ms | 14316 KB |
sample-03.txt | AC | 180 ms | 14336 KB |
sample-04.txt | AC | 179 ms | 14316 KB |