QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #408714 | #8217. King's Dinner | feather_life | AC ✓ | 2ms | 3664kb | C++14 | 1.6kb | 2024-05-10 21:49:54 | 2024-05-10 21:50:28 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
char a[105][105];
void fill(int ox,int oy,int x,int y)
{
if(x % 2 == 0 && y % 3 == 0)
{
for(int i = 0;i < x;i += 2)
{
for(int j = 0;j < y;j += 3)
{
a[ox + i][oy + j] = '#';
a[ox + i][oy + j + 1] = '#';
}
}
}
else
{
for(int i = 0;i < x;i += 3)
{
for(int j = 0;j < y;j += 2)
{
a[ox + i][oy + j] = '#';
a[ox + i + 1][oy + j] = '#';
}
}
}
}
void solve()
{
cin >> n;
n++;
for(int i = 0;i < n;i++)
{
for(int j = 0;j < n;j++)
{
a[i][j] = '.';
}
}
if(n % 6 == 0)
{
fill(0,0,n,n);
}
if(n % 6 == 1)
{
fill(0,0,n - 4,n - 3);
fill(n - 4,0,4,n - 4);
fill(0,n - 3,n - 3,3);
fill(n - 3,n - 4,3,4);
}
if(n % 6 == 2)
{
fill(0,0,n,n - 2);
fill(0,n - 2,n - 2,2);
}
if(n % 6 == 3)
{
fill(0,0,n,n - 3);
fill(0,n - 3,n - 1,3);
}
if(n % 6 == 4)
{
fill(0,0,n,n - 4);
fill(0,n - 4,n - 1,4);
}
if(n % 6 == 5)
{
fill(0,0,n - 2,n - 3);
fill(n - 2,0,2,n - 2);
fill(0,n - 3,n - 3,3);
fill(n - 3,n - 2,3,2);
}
for(int i = 0;i < n - 1;i++)
{
for(int j = 0;j < n - 1;j++)
{
cout << a[i][j];
}
cout << '\n';
}
}
int main()
{
int T;
cin >> T;
while(T--)solve();
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3656kb
input:
3 1 2 3
output:
. ## .. #.# #.# ...
result:
ok all tests correct (3 test cases)
Test #2:
score: 0
Accepted
time: 1ms
memory: 3580kb
input:
50 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
output:
. ## .. #.# #.# ... #.## #... ...# ##.# ##.## ..... ##.## ..... ##.## #.#.## #.#... ....## ##.... ...#.# ##.#.# ##.##.# ......# ##.##.. ......# ##.##.# ....... ##.##.. #.#.#.## #.#.#... ......## #.#.#... #.#.#.## ........ #.#.#.## #.#.#... ##.##.#.# ......#.# ##.##.... ......#.# ##.##.#.# ......... ...
result:
ok all tests correct (50 test cases)
Test #3:
score: 0
Accepted
time: 2ms
memory: 3512kb
input:
39 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
output:
##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.#.# ................................................#.# ##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.... ................................................#.# ##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.#.# ...........................................
result:
ok all tests correct (39 test cases)
Test #4:
score: 0
Accepted
time: 1ms
memory: 3512kb
input:
11 90 91 92 93 94 95 96 97 98 99 100
output:
#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.## #.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#... ........................................................................................## #.#.#.#.#.#.#.#.#.#.#.#.#.#...
result:
ok all tests correct (11 test cases)
Test #5:
score: 0
Accepted
time: 1ms
memory: 3664kb
input:
1 100
output:
#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.## #.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#... .....................................................................................................
result:
ok all tests correct (1 test case)
Extra Test:
score: 0
Extra Test Passed