Submission #2257230
Source Code Expand
/** * File : D.cpp * Author : Kazune Takahashi * Created : 2018-3-25 21:07:52 * Powered by Visual Studio Code */ #include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> #include <random> // random_device rd; mt19937 mt(rd()); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int A, B; bool ans[100][100]; void flush() { cout << 100 << " " << 100 << endl; for (auto i = 0; i < 100; i++) { for (auto j = 0; j < 100; j++) { cout << (ans[i][j] ? '#' : '.'); } cout << endl; } } int main() { cin >> A >> B; for (auto i = 0; i < 50; i++) { for (auto j = 0; j < 100; j++) { ans[i][j] = true; } } for (auto i = 50; i < 100; i++) { for (auto j = 0; j < 100; j++) { ans[i][j] = false; } } int nowa = 1; while (nowa < A) { for (auto i = 1; i < 100; i += 2) { for (auto j = 1; j < 100; j += 2) { ans[i][j] = false; nowa++; if (nowa >= A) { break; } } if (nowa >= A) { break; } } } int nowb = 1; while (nowb < B) { for (auto i = 51; i < 100; i += 2) { for (auto j = 1; j < 100; j += 2) { ans[i][j] = true; nowb++; if (nowb >= B) { break; } } if (nowb >= B) { break; } } } flush(); }
Submission Info
Submission Time | |
---|---|
Task | D - Grid Components |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 2073 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 |