QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#172115#7178. Bishopsucup-team1359#WA 21ms3960kbC++14915b2023-09-09 18:04:202023-09-09 18:04:21

Judging History

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

  • [2023-09-09 18:04:21]
  • 评测
  • 测评结果:WA
  • 用时:21ms
  • 内存:3960kb
  • [2023-09-09 18:04:20]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int n,m,ans,ansx;
int main() {
    scanf("%d%d",&n,&m);
    if (n>=m) {
        for (int x=1;x<=m;x++) {
            if (((n+x-1)/x)*x>ans) {
                ans=((n+x-1)/x)*x;
                ansx=x;
            }
        }
        printf("%d\n",ans);
        for (int x=1;x<=n;x+=ansx) {
            for (int y=1;y<=ansx;y++) printf("%d %d\n",x,y);
        }
        return 0;
    }
    for (int x=1;x<=n;x++) {
        if (((m+x-1)/x)*x>ans) {
            ans=((m+x-1)/x)*x;
            ansx=x;
        }
    }
    printf("%d\n",ans);
    for (int y=1;y<=m;y+=ansx) {
        for (int x=1;x<=ansx;x++) printf("%d %d\n",x,y);
    }
    return 0;
}
/*
#.#.#
oxoxo
#.#.#
.#.#.
#.#.#
.#.#.
xoxox
(x,y) (x+y-1,m+x-y)

****#
***.*.
**#*#*#
*.*.*.*.
#*#*#*#*#
*.*.*.*.*.
**#*#*#*#*#
***.*.*.*.
****#*#*#
*****.*.
******#
*/

详细

Test #1:

score: 100
Accepted
time: 2ms
memory: 3836kb

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: 1ms
memory: 3960kb

input:

5 5

output:

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

result:

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

Test #3:

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

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: 21ms
memory: 3912kb

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: -100
Wrong Answer
time: 15ms
memory: 3852kb

input:

100000 50000

output:

149997
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:

wrong answer Participant's answer is not optimal (149997 < 149998)