Submission #3239555
Source Code Expand
#include<stdio.h> #include<iostream> #include<stdlib.h> #include<vector> #include<algorithm> #include<utility> #include<string> #include<queue> #include<stack> #include<map> #include<set> #include<iterator> #include<math.h> using namespace std; #define int long long /* */ //#undef int #define INF 1000000009 #define INFL 1000000000000000018ll #define mod 1000000007 #define pb push_back #define fi first #define se second #define mk(a, b) make_pair(a, b) typedef pair<int, int> PA; typedef priority_queue<int> PQ; typedef priority_queue<PA, vector<PA>, greater<PA> >PQG; int a, b, d[9] = {-1, -1, 0, 1, -1, 1, 1, 0, -1}; char c[110][110]; signed main() { cin >> a >> b; for(int i = 1; i <= 100; i++){ for(int j = 1; j <= 100; j++){ if(i <= 50){ c[i][j] = '.'; } else{ c[i][j] = '#'; } } } int cnt1 = 0, cnt2 = 0; for(int i = 1; i <= 100; i++){ for(int j = 1; j <= 100; j++){ if(i <= 49){ bool flag = false; for(int k = 0; k < 8; k++){ if(c[i + d[k]][j + d[k + 1]] == '#'){ flag = true; } } if(!flag && cnt1 < b - 1){ c[i][j] = '#'; cnt1++; } } else if(i >= 52){ bool flag = false; for(int k = 0; k < 8; k++){ if(c[i + d[k]][j + d[k + 1]] == '.'){ flag = true; } } if(!flag && cnt2 < a - 1){ c[i][j] = '.'; cnt2++; } } } } printf("100 100\n"); for(int i = 1; i <= 100; i++){ for(int j = 1; j <= 100; j++){ printf("%c", c[i][j]); } printf("\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Grid Components |
User | youluoy |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 2076 Byte |
Status | AC |
Exec Time | 1 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 | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
14.txt | AC | 1 ms | 256 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 1 ms | 256 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 1 ms | 256 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 1 ms | 256 KB |
29.txt | AC | 1 ms | 256 KB |
30.txt | AC | 1 ms | 256 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 1 ms | 256 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 1 ms | 256 KB |
35.txt | AC | 1 ms | 256 KB |
36.txt | AC | 1 ms | 256 KB |
37.txt | AC | 1 ms | 256 KB |
38.txt | AC | 1 ms | 256 KB |
39.txt | AC | 1 ms | 256 KB |
40.txt | AC | 1 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |
sample-04.txt | AC | 1 ms | 256 KB |