QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#172098 | #7178. Bishops | ucup-team1359# | TL | 1ms | 3636kb | C++14 | 899b | 2023-09-09 18:03:00 | 2023-09-09 18:03:00 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n,m,ans,ansx;
int main() {
cin>>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;
}
}
cout<<ans<<endl;
for (int x=1;x<=n;x+=ansx) {
for (int y=1;y<=ansx;y++) cout<<x<<' '<<y<<endl;
}
return 0;
}
for (int x=1;x<=n;x++) {
if (((m+x-1)/x)*x>ans) {
ans=((m+x-1)/x)*x;
ansx=x;
}
}
cout<<ans<<endl;
for (int y=1;y<=m;y+=ansx) {
for (int x=1;x<=ansx;x++) cout<<x<<' '<<y<<endl;
}
return 0;
}
/*
#.#.#
oxoxo
#.#.#
.#.#.
#.#.#
.#.#.
xoxox
(x,y) (x+y-1,m+x-y)
****#
***.*.
**#*#*#
*.*.*.*.
#*#*#*#*#
*.*.*.*.*.
**#*#*#*#*#
***.*.*.*.
****#*#*#
*****.*.
******#
*/
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3636kb
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: 3576kb
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: -100
Time Limit Exceeded
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 ...