QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#183302#7178. BishopsScarlett_boyWA 19ms17200kbC++172.9kb2023-09-19 13:21:252023-09-19 13:21:25

Judging History

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

  • [2023-09-19 13:21:25]
  • 评测
  • 测评结果：WA
  • 用时：19ms
  • 内存：17200kb
查看
  • [2023-09-19 13:21:25]
  • 提交

answer

#include "bits/stdc++.h"

typedef long long ll;
using namespace std;


int n, m;
vector<pair<int, int>> vec;

void dfs(int a, int b, int x, int y) {
    if (x == y) {
        for (int i = b; i < b + y; i++) vec.emplace_back(a, i);
        for (int i = b + 1; i < b + y - 1; i++) vec.emplace_back(a + x - 1, i);
        return;
    }
    if (x > y) {
        if (y == 3) {
            if (x >= 7) {
                for (int i = 0; i < y; i++) vec.emplace_back(a, b + i);
                dfs(a + y, b, x - y, y);
            } else {
                if (x == 4) {
                    for (int i = 0; i < y; i++) vec.emplace_back(a, b + i);
                    for (int i = 0; i < y; i++) vec.emplace_back(a + 3, b + i);
                } else if (x == 5) {
                    for (int i = 0; i < y; i++) vec.emplace_back(a, b + i);
                    vec.emplace_back(a + 2, b + 1);
                    for (int i = 0; i < y; i++) vec.emplace_back(a + 4, b + i);
                } else {// x==6
                    for (int i = 0; i < y; i++) vec.emplace_back(a, b + i);
                    vec.emplace_back(a + 2, b + 1);
                    vec.emplace_back(a + 3, b + 1);
                    for (int i = 0; i < y; i++) vec.emplace_back(a + 5, b + i);
                }
                return;
            }
        } else {
            for (int i = 0; i < y; i++) vec.emplace_back(a, b + i);
            dfs(a + y, b, x - y, y);
        }
    }
    if (x < y) {
        if (x == 3) {
            if (y >= 7) {
                for (int i = 0; i < x; i++) vec.emplace_back(a + i, b);
                dfs(a, b + x, x, y - x);
            } else {
                if (y == 4) {
                    for (int i = 0; i < x; i++) vec.emplace_back(a, b + i);
                    for (int i = 0; i < x; i++) vec.emplace_back(a + 3, b + i);
                } else if (y == 5) {
                    for (int i = 0; i < x; i++) vec.emplace_back(a, b + i);
                    vec.emplace_back(a + 2, b + 1);
                    for (int i = 0; i < x; i++) vec.emplace_back(a + 4, b + i);
                } else if (y == 6) {
                    for (int i = 0; i < x; i++) vec.emplace_back(a, b + i);
                    vec.emplace_back(a + 2, b + 1);
                    vec.emplace_back(a + 3, b + 1);
                    for (int i = 0; i < x; i++) vec.emplace_back(a + 5, b + i);
                }
                return;
            }
        } else {
            for (int i = 0; i < x; i++) vec.emplace_back(a + i, b);
            dfs(a, b + x, x, y - x);
        }
    }
}

void solve() {
    cin >> n >> m;
    dfs(1, 1, n, m);
    cout << vec.size() << '\n';
    for (auto [a, b]: vec) {
        cout << a << ' ' << b << '\n';
    }
}


signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int _ = 1;
//    cin >> _;
    for (int o = 1; o <= _; o++) {
        solve();
    }
    return 0;
}
/*




 */
Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 5

output:

6
1 1
2 1
1 3
2 3
1 5
2 5

result:

ok n: 2, m: 5, bishops: 6

Test #2:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

5 5

output:

8
1 1
1 2
1 3
1 4
1 5
5 2
5 3
5 4

result:

ok n: 5, m: 5, bishops: 8

Test #3:

score: 0
Accepted
time: 19ms
memory: 5164kb

input:

100000 100000

output:

199998
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 ...

result:

ok n: 100000, m: 100000, bishops: 199998

Test #4:

score: 0
Accepted
time: 12ms
memory: 17200kb

input:

100000 99999

output:

199998
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 ...

result:

ok n: 100000, m: 99999, bishops: 199998

Test #5:

score: 0
Accepted
time: 15ms
memory: 5144kb

input:

100000 50000

output:

149998
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 ...

result:

ok n: 100000, m: 50000, bishops: 149998

Test #6:

score: 0
Accepted
time: 12ms
memory: 16652kb

input:

1 100000

output:

100000
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 ...

result:

ok n: 1, m: 100000, bishops: 100000

Test #7:

score: 0
Accepted
time: 13ms
memory: 5148kb

input:

34535 99889

output:

134423
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 1
46 1
47 1
48 1
49 1
50 1
51 1
52 1
53 1
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61...

result:

ok n: 34535, m: 99889, bishops: 134423

Test #8:

score: 0
Accepted
time: 12ms
memory: 4192kb

input:

12231 97889

output:

110119
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 1
46 1
47 1
48 1
49 1
50 1
51 1
52 1
53 1
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61...

result:

ok n: 12231, m: 97889, bishops: 110119

Test #9:

score: 0
Accepted
time: 11ms
memory: 4160kb

input:

10000 100000

output:

109998
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 1
46 1
47 1
48 1
49 1
50 1
51 1
52 1
53 1
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61...

result:

ok n: 10000, m: 100000, bishops: 109998

Test #10:

score: 0
Accepted
time: 6ms
memory: 4988kb

input:

13 99999

output:

100011
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
1 14
2 14
3 14
4 14
5 14
6 14
7 14
8 14
9 14
10 14
11 14
12 14
13 14
1 27
2 27
3 27
4 27
5 27
6 27
7 27
8 27
9 27
10 27
11 27
12 27
13 27
1 40
2 40
3 40
4 40
5 40
6 40
7 40
8 40
9 40
10 40
11 40
12 40
13 40
1 53
2 53
3 53
4 53
5 53
6 53
...

result:

ok n: 13, m: 99999, bishops: 100011

Test #11:

score: -100
Wrong Answer
time: 10ms
memory: 4648kb

input:

21 99999

output:

100019
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
1 22
2 22
3 22
4 22
5 22
6 22
7 22
8 22
9 22
10 22
11 22
12 22
13 22
14 22
15 22
16 22
17 22
18 22
19 22
20 22
21 22
1 43
2 43
3 43
4 43
5 43
6 43
7 43
8 43
9 43
10 43
11 43
12 43
13 43
14 43
15 43...

result:

wrong answer Integer parameter [name=x] equals to 22, violates the range [1, 21]
English 繁體中文 简体中文

Server Time: 2024-12-02 20:21:46 | OpenSource Project