QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#359209#8217. King's Dinnerinstallb#AC ✓2ms3716kbC++202.4kb2024-03-20 14:44:202024-03-20 14:44:21

Judging History

你现在查看的是最新测评结果

  • [2024-03-20 14:44:21]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3716kb
  • [2024-03-20 14:44:20]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

char c[105][105];

void dfs(int n,int ad){
    if(n <= 2) return;
    if(n == 3){
        c[ad + 1][ad + 1] = '#';
        c[ad + 2][ad + 1] = '#';
        return;
    }
    if(n == 4){
        c[ad + 1][ad + 1] = '#';
        c[ad + 2][ad + 1] = '#';
        c[ad + 1][ad + 3] = '#';
        c[ad + 2][ad + 3] = '#';
        return;
    }
    if(n % 3 == 0){
        if(n % 6 == 0){
            for(int i = 1;i <= n;i += 2){
                for(int j = 1;j <= n;j += 3){
                    c[ad + i][ad + j] = c[ad + i][ad + j + 1] = '#';
                }
            }
        }
        else{
            for(int i = 1;i <= n - 3;i += 2){
                for(int j = 1;j <= n;j += 3){
                    c[ad + i][ad + j] = c[ad + i][ad + j + 1] = '#';
                }
            }
            for(int j = 1;j <= n;j += 2) c[ad + n - 2][j] = c[ad + n - 1][j] = '#';
        }
    }
    if(n % 3 == 1){
        for(int i = 1;i <= n - 4;i += 3){
            c[ad + 1][ad + i] = c[ad + 1][ad + i + 1] = '#'; c[ad + 3][ad + i] = c[ad + 3][ad + i + 1] = '#';
            c[ad + i][ad + n - 1] = c[ad + i + 1][ad + n - 1] = '#'; c[ad + i][ad + n - 3] = c[ad + i + 1][ad + n - 3] = '#';
            c[ad + n - 1][ad + n - i] = c[ad + n - 1][ad + n - i - 1] = '#'; c[ad + n - 3][ad + n - i] = c[ad + n - 3][ad + n - i - 1] = '#';
            c[ad + n - i][ad + 1] = c[ad + n - i - 1][ad + 1] = '#'; c[ad + n - i][ad + 3] = c[ad + n - i - 1][ad + 3] = '#';
        }
        dfs(n - 8,ad + 4);
    }
    if(n % 3 == 2){
        for(int i = 1;i <= n - 2;i += 3){
            c[ad + 1][ad + i] = c[ad + 1][ad + i + 1] = '#';
            c[ad + i][ad + n - 1] = c[ad + i + 1][ad + n - 1] = '#';
            c[ad + n - 1][ad + n - i] = c[ad + n - 1][ad + n - i - 1] = '#';
            c[ad + n - i][ad + 1] = c[ad + n - i - 1][ad + 1] = '#';
        }
        dfs(n - 4,ad + 2);
    }
}

void solve(){
    int n; cin >> n; n ++;
    for(int i = 1;i < n;i ++){
        for(int j = 1;j < n;j ++){
            c[i][j] = '.';
        }
    }
    dfs(n,0);
    for(int i = 1;i < n;i ++){
        for(int j = 1;j < n;j ++){
            cout << c[i][j];
        }
        cout << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    int TC;
    cin >> TC;
    while(TC --) solve();
    return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3576kb

input:

3
1
2
3

output:

.
#.
#.
#.#
#.#
...

result:

ok all tests correct (3 test cases)

Test #2:

score: 0
Accepted
time: 1ms
memory: 3716kb

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: 3680kb

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: 3580kb

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: 3648kb

input:

1
100

output:

##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.#
...................................................................................................#
#.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.##.#.#...

result:

ok all tests correct (1 test case)

Extra Test:

score: 0
Extra Test Passed