QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#334866 | #8217. King's Dinner | ucup-team1209# | AC ✓ | 2ms | 3684kb | C++20 | 3.1kb | 2024-02-22 14:43:23 | 2024-02-22 14:43:24 |
Judging History
answer
#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
cs int N = 105;
int mp[N][N], n, T;
void paint(int a, int b, int c, int d) {
// cerr << a << ' ' << b << ' ' << c << ' ' << d << endl;
assert((c - a) * (d - b) == 2);
assert(a < c && b < d);
mp[a][b] = mp[c - 1][d - 1] = 1;
}
void work(int n) {
for(int i = 1; i < n; i += 2)
for(int j = 1; j < n; j += 3)
paint(i, j, i + 1, j + 2);
}
void Paint(int a, int b, int c, int d) {
paint(a, b, c, d);
paint(b, a, d, c);
}
void work5(int n) {
work(n - 5);
for(int i = 1; i < n - 5; i += 6) {
Paint(n - 4, i, n - 2, i + 1);
Paint(n - 4, i + 2, n - 2, i + 3);
Paint(n - 4, i + 4, n - 2, i + 5);
Paint(n - 1, i, n, i + 2);
Paint(n - 1, i + 3, n, i + 5);
}
paint(n - 4, n - 4, n - 3, n - 2);
paint(n - 2, n - 4, n, n - 3);
paint(n - 1, n - 2, n, n);
paint(n - 4, n - 1, n - 2, n);
}
void work1(int n) {
if(n == 1) return;
work(n - 7);
for(int i = 1; i < n - 7; i += 6) {
Paint(n - 6, i, n - 4, i + 1);
Paint(n - 6, i + 2, n - 4, i + 3);
Paint(n - 6, i + 4, n - 4, i + 5);
Paint(n - 3, i, n - 2, i + 2);
Paint(n - 3, i + 3, n - 2, i + 5);
Paint(n - 1, i, n, i + 2);
Paint(n - 1, i + 3, n, i + 5);
}
paint(n - 6, n - 6, n - 4, n - 5);
paint(n - 6, n - 4, n - 4, n - 3);
paint(n - 6, n - 2, n - 5, n);
paint(n - 4, n - 2, n - 3, n);
paint(n - 3, n - 6, n - 2, n - 4);
paint(n - 1, n - 6, n, n - 4);
paint(n - 2, n - 3, n, n - 2);
paint(n - 2, n - 1, n, n);
}
void Main() {
cin >> n; ++ n;
// cout << "FFFFFFFFFFFFFFFF " << n << endl;
for(int i = 0; i <= n; i++)
for(int j = 0; j <= n; j++) mp[i][j] = 0;
if(n % 6 == 0) {
work(n);
}
if(n % 6 == 2) {
work(n - 2);
for(int i = 1; i < n - 2; i += 3)
paint(n - 1, i, n, i + 2);
for(int i = 1; i < n - 2; i += 3)
paint(i, n - 1, i + 2, n);
}
if(n % 6 == 3) {
work(n - 3);
for(int i = 1; i < n - 3; i += 2)
paint(n - 2, i, n, i + 1);
for(int i = 1; i < n - 1; i += 2)
paint(i, n - 2, i + 1, n);
}
if(n % 6 == 4) {
work(n - 4);
for(int i = 1; i < n - 4; i += 3)
paint(n - 3, i, n - 2, i + 2);
for(int i = 1; i < n - 4; i += 3)
paint(n - 1, i, n, i + 2);
for(int i = 1; i < n - 1; i += 3)
paint(i, n - 3, i + 2, n - 2);
for(int i = 1; i < n - 1; i += 3)
paint(i, n - 1, i + 2, n);
}
if(n % 6 == 5) {
work5(n);
}
if(n % 6 == 1) {
work1(n);
}
for(int i = 1; i < n; i++) {
for(int j = 1; j < n; j++) {
if(mp[i][j]) cout << "#";
else cout << ".";
}
cout << '\n';
}
}
int main() {
#ifdef zqj
freopen("1.in","r",stdin);
#endif
ios :: sync_with_stdio(0), cin.tie(0);
cin >> T;
while(T--) Main();
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
3 1 2 3
output:
. ## .. #.# #.# ...
result:
ok all tests correct (3 test cases)
Test #2:
score: 0
Accepted
time: 1ms
memory: 3676kb
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: 0ms
memory: 3684kb
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: 2ms
memory: 3592kb
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: 3660kb
input:
1 100
output:
##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.# ...................................................................................................# ##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##...
result:
ok all tests correct (1 test case)
Extra Test:
score: 0
Extra Test Passed