QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #715260 | #8217. King's Dinner | ucup-team5071# | AC ✓ | 3ms | 3752kb | C++20 | 1.6kb | 2024-11-06 11:09:11 | 2024-11-06 11:09:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
void Solve(){
int n;
cin>>n;
vector <vector<char>> ans(n+1,vector<char>(n+1));
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
ans[i][j]='.';
if(n&1){
for(int i=1;i<=n;i+=2)
for(int j=1;j+1<=n;j+=3)
ans[j][i]=ans[j+1][i]='#';
if(n%3==1){
for(int i=1;i+1<=n;i+=3)
ans[n][i]=ans[n][i+1]='#';
}
else if(n%3==0){
for(int i=1;i<=n;i++)
ans[n-1][i]=ans[n-2][i]='.';
for(int i=1;i+1<=n;i+=3)
ans[n][i]=ans[n][i+1]=ans[n-2][i]=ans[n-2][i+1]='#';
}
}
else {
for(int i=1;i<=n-2;i+=2)
for(int j=1;j+1<=n;j+=3)
ans[j][i]=ans[j+1][i]='#';
for(int j=1;j<=n;j+=2)
ans[j][n-1]=ans[j][n]='#';
if(n%3==1){
for(int i=1;i+1<=n-2;i+=3)
ans[n][i]=ans[n][i+1]='#';
}
else if(n%3==0){
for(int i=1;i<=n-2;i++)
ans[n-1][i]=ans[n-2][i]='.';
for(int i=1;i+1<=n-2;i+=3)
ans[n][i]=ans[n][i+1]=ans[n-2][i]=ans[n-2][i+1]='#';
}
if(n%3==1||n%3==0)ans[n][n]='#',ans[n-1][n-1]='.';
if(n%3==0)ans[n][n-2]=ans[n-1][n-2]='#';
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
cout<<ans[i][j];
cout<<"\n";
}
}
int main(){
// ios::sync_with_stdio(false),cin.tie(0);
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: 0ms
memory: 3752kb
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: 3ms
memory: 3600kb
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: 3484kb
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: 3636kb
input:
1 100
output:
#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.## #.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#... .....................................................................................................
result:
ok all tests correct (1 test case)
Extra Test:
score: 0
Extra Test Passed