Submission #2870121
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<functional> #include<queue> #include<stack> #include<set> #include<climits> #include<cstdlib> #include<cmath> #include<string> using namespace std; #define INF 1 << 29 #define LL long long int LL const MOD = 1000000007; int main(){ cin.tie(0); ios::sync_with_stdio(false); LL a,b; cin >> a >> b; vector<string> str(100); for(int i = 0; i < 50; i++){ for(int j = 0; j < 100; j++){ str[i] += "."; } } for(int i = 50; i < 100; i++){ for(int j = 0; j < 100; j++){ str[i] += "#"; } } a--; b--; int k = 1; int l = 1; while(b > 0){ str[k][l] = '#'; l += 2; if(l >= 100){ l = 1; k += 2; } b--; } k = 51; l = 1; while(a > 0){ str[k][l] = '.'; l += 2; if(l >= 100){ l = 1; k += 2; } a--; } for(int i = 0; i < 100; i++){ cout << str[i] << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Grid Components |
User | rtia1227 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1179 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
02.txt | WA | 1 ms | 256 KB |
03.txt | WA | 1 ms | 256 KB |
04.txt | WA | 1 ms | 256 KB |
05.txt | WA | 1 ms | 256 KB |
06.txt | WA | 1 ms | 256 KB |
07.txt | WA | 1 ms | 256 KB |
08.txt | WA | 1 ms | 256 KB |
09.txt | WA | 1 ms | 256 KB |
10.txt | WA | 1 ms | 256 KB |
11.txt | WA | 1 ms | 256 KB |
12.txt | WA | 1 ms | 256 KB |
13.txt | WA | 1 ms | 256 KB |
14.txt | WA | 1 ms | 256 KB |
15.txt | WA | 1 ms | 256 KB |
16.txt | WA | 1 ms | 256 KB |
17.txt | WA | 1 ms | 256 KB |
18.txt | WA | 1 ms | 256 KB |
19.txt | WA | 1 ms | 256 KB |
20.txt | WA | 1 ms | 256 KB |
21.txt | WA | 1 ms | 256 KB |
22.txt | WA | 1 ms | 256 KB |
23.txt | WA | 1 ms | 256 KB |
24.txt | WA | 1 ms | 256 KB |
25.txt | WA | 1 ms | 256 KB |
26.txt | WA | 1 ms | 256 KB |
27.txt | WA | 1 ms | 256 KB |
28.txt | WA | 1 ms | 256 KB |
29.txt | WA | 1 ms | 256 KB |
30.txt | WA | 1 ms | 256 KB |
31.txt | WA | 1 ms | 256 KB |
32.txt | WA | 1 ms | 256 KB |
33.txt | WA | 1 ms | 256 KB |
34.txt | WA | 1 ms | 256 KB |
35.txt | WA | 1 ms | 256 KB |
36.txt | WA | 1 ms | 256 KB |
37.txt | WA | 1 ms | 256 KB |
38.txt | WA | 1 ms | 256 KB |
39.txt | WA | 1 ms | 256 KB |
40.txt | WA | 1 ms | 256 KB |
sample-01.txt | WA | 1 ms | 256 KB |
sample-02.txt | WA | 1 ms | 256 KB |
sample-03.txt | WA | 1 ms | 256 KB |
sample-04.txt | WA | 1 ms | 256 KB |