QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #796240 | #8217. King's Dinner | ucup-team173# | AC ✓ | 2ms | 3796kb | C++23 | 2.1kb | 2024-12-01 15:02:52 | 2024-12-01 15:02:53 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n;
cin >> n;
vector ans(n, vector<int>(n));
if(n % 2 == 1) {
for(int i = 1; i < n; i += 3) {
for(int j = 0; j < n; j += 2) {
ans[i - 1][j] = ans[i][j] = 1;
}
}
if(n % 3 == 1) { // 1
for(int i = 2; i < n; i += 3) {
ans[n - 1][i - 2] = ans[n - 1][i - 1] = 1;
}
} else if(n % 3 == 0 && n > 3) { // 3
for(int i = 0; i < n; i++) {
ans[n - 2][i] = ans[n - 3][i] = 0;
}
for(int i = 2; i < n; i += 3) {
ans[n - 3][i - 2] = ans[n - 3][i - 1] = 1;
ans[n - 1][i - 2] = ans[n - 1][i - 1] = 1;
}
}
} else if(n % 3 == 2) { // 2
for(int i = 0; i < n; i+= 2) {
for(int j = 1; j < n; j += 3) {
ans[i][j - 1] = ans[i][j] = 1;
}
}
for(int i = 0; i < n; i++) {
ans[n - 2][i] = 0;
}
for(int i = 0; i < n; i += 2) {
ans[n - 1][i] = ans[n - 2][i] = 1;
}
} else { // 6 / 4
auto dfs = [&](auto self, int l, int r) {
int len = r - l + 1;
if(len < 3) return;
int cnt = (len - 2) / 2;
for(int i = 0; i < cnt; i++) {
ans[l + 2 * i][l] = ans[l + 2 * i][l + 1] = 1;
ans[r][l + 2 * i] = ans[r - 1][l + 2 * i] = 1;
ans[l][r - 2 * i] = ans[l + 1][r - 2 * i] = 1;
ans[r - 2 * i][r] = ans[r - 2 * i][r - 1] = 1;
}
self(self, l + 3, r - 3);
};
dfs(dfs, 0, n - 1);
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
cout << ".#"[ans[i][j]];
}
cout << '\n';
}
}
signed main() {
// ios::sync_with_stdio(false);
// cin.tie(0), cout.tie(0);
int t = 1;
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: 3796kb
input:
3 1 2 3
output:
. #. #. #.# #.# ...
result:
ok all tests correct (3 test cases)
Test #2:
score: 0
Accepted
time: 1ms
memory: 3644kb
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: 3656kb
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: 3532kb
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: 3680kb
input:
1 100
output:
##.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.# ...#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.# ##...................................................................................................
result:
ok all tests correct (1 test case)
Extra Test:
score: 0
Extra Test Passed