Submission #5076022
Source Code Expand
#define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; signed main() { ios::sync_with_stdio(false); cin.tie(0); int ans[100][100] = {}; for (int i = 0; i < 50; i++) { for (int j = 0; j < 100; j++) { ans[i][j] = 1; } } int a, b; cin >> a >> b; a--; b--; int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}; for (int i = 0; i < 50; i++) { for (int j = 0; j < 100; j++) { if (a == 0) break; if (ans[i][j] == 0) continue; bool ok = true; for (int u = 0; u < 4; u++) { for (int v = 0; v < 4; v++) { int x = i + dx[u]; int y = j + dy[v]; if (x < 0 || x >= 100 || y < 0 || y >= 100) continue; if (ans[x][y] == 0) ok = false; } } if (ok) { ans[i][j] = 0; a--; } } } for (int i = 50; i < 100; i++) { for (int j = 0; j < 100; j++) { if (b == 0) break; if (ans[i][j] == 1) continue; bool ok = true; for (int u = 0; u < 4; u++) { for (int v = 0; v < 4; v++) { int x = i + dx[u]; int y = j + dy[v]; if (x < 0 || x >= 100 || y < 0 || y >= 100) continue; if (ans[x][y] == 1) ok = false; } } if (ok) { ans[i][j] = 1; b--; } } } cout << 100 << " " << 100 << endl; for (int i = 0; i < 100; i++) { for (int j = 0; j < 100; j++) { cout << (ans[i][j] ? '#' : '.'); } cout << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Grid Components |
User | Mayimg |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1556 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 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 | 2 ms | 256 KB |
02.txt | AC | 2 ms | 256 KB |
03.txt | AC | 2 ms | 256 KB |
04.txt | AC | 2 ms | 256 KB |
05.txt | AC | 2 ms | 256 KB |
06.txt | AC | 2 ms | 256 KB |
07.txt | AC | 2 ms | 256 KB |
08.txt | AC | 2 ms | 256 KB |
09.txt | AC | 2 ms | 256 KB |
10.txt | AC | 2 ms | 256 KB |
11.txt | AC | 2 ms | 256 KB |
12.txt | AC | 2 ms | 256 KB |
13.txt | AC | 2 ms | 256 KB |
14.txt | AC | 2 ms | 256 KB |
15.txt | AC | 2 ms | 256 KB |
16.txt | AC | 2 ms | 256 KB |
17.txt | AC | 2 ms | 256 KB |
18.txt | AC | 2 ms | 256 KB |
19.txt | AC | 2 ms | 256 KB |
20.txt | AC | 2 ms | 256 KB |
21.txt | AC | 2 ms | 256 KB |
22.txt | AC | 2 ms | 256 KB |
23.txt | AC | 2 ms | 256 KB |
24.txt | AC | 2 ms | 256 KB |
25.txt | AC | 2 ms | 256 KB |
26.txt | AC | 2 ms | 256 KB |
27.txt | AC | 2 ms | 256 KB |
28.txt | AC | 2 ms | 256 KB |
29.txt | AC | 2 ms | 256 KB |
30.txt | AC | 2 ms | 256 KB |
31.txt | AC | 2 ms | 256 KB |
32.txt | AC | 2 ms | 256 KB |
33.txt | AC | 2 ms | 256 KB |
34.txt | AC | 2 ms | 256 KB |
35.txt | AC | 2 ms | 256 KB |
36.txt | AC | 2 ms | 256 KB |
37.txt | AC | 2 ms | 256 KB |
38.txt | AC | 2 ms | 256 KB |
39.txt | AC | 2 ms | 256 KB |
40.txt | AC | 2 ms | 256 KB |
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | AC | 2 ms | 256 KB |
sample-03.txt | AC | 2 ms | 256 KB |
sample-04.txt | AC | 2 ms | 256 KB |