QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #409006 | #8217. King's Dinner | rbtree | AC ✓ | 2ms | 3744kb | C++23 | 1.1kb | 2024-05-11 15:17:59 | 2024-05-11 15:18:00 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
char ans[101][101];
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){
ans[ox+i][oy+j]='#';
ans[ox+i][oy+j+1]='#';
}
}
}
else{
for(int i=0; i<x ;i+=3){
for(int j=0; j<y ;j+=2){
ans[ox+i][oy+j]='#';
ans[ox+i+1][oy+j]='#';
}
}
}
}
void solve(){
cin >> n;++n;
for(int i=0; i<n ;i++){
for(int j=0; j<n ;j++){
ans[i][j]='.';
}
}
if(n%6==0){
fill(0,0,n,n);
}
if(n%6==3){
fill(0,0,n,n-3);
fill(0,n-3,n-1,3);
}
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==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);
}
if(n%6==4){
fill(0,0,n,n-4);
fill(0,n-4,n-1,4);
}
if(n%6==2){
fill(0,0,n,n-2);
fill(0,n-2,n-2,2);
}
for(int i=0; i<n-1 ;i++){
for(int j=0; j<n-1 ;j++){
cout << ans[i][j];
}
cout << '\n';
}
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);
int t;cin >> t;while(t--) solve();
}
这程序好像有点Bug，我给组数据试试？
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3744kb
input:
3 1 2 3
output:
. ## .. #.# #.# ...
result:
ok all tests correct (3 test cases)
Test #2:
score: 0
Accepted
time: 1ms
memory: 3624kb
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: 3704kb
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: 3684kb
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: 0ms
memory: 3736kb
input:
1 100
output:
#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.## #.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#... .....................................................................................................
result:
ok all tests correct (1 test case)
Extra Test:
score: 0
Extra Test Passed