QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#440257	#7178. Bishops	lzytag	WA	13ms	3704kb	C++14	1.5kb	2024-06-13 14:42:12	2024-06-13 14:42:12

Judging History

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

[2024-06-13 14:42:12]
评测

测评结果：WA
用时：13ms
内存：3704kb

查看

[2024-06-13 14:42:12]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N = 5e5+5;
int n,m;
int main()
{
    //freopen("bishop.in","r",stdin);
    //freopen("bishop.out","w",stdout);
    ios::sync_with_stdio(false);cin.tie(0);
    cin>>n>>m;
    if(n == m)
    {
        cout<<n+m-2<<"\n";
        for(int i = 1;i <= n;i++) cout<<"1 "<<i<<"\n";
        for(int i = 2;i < n;i++) cout<<n<<" "<<i<<"\n";
        return 0;
    }
    if(n < m)
    {
        if(n & 1)
        {
            cout<<n+m-1<<"\n";
            for(int i = 1;i <= n;i++) cout<<i<<" 1\n"<<i<<" "<<m<<"\n";
            int fr = (n+1)/2+1,to = m-(n+1)/2;
            for(int i = fr;i <= to;i++) cout<<(n+1)/2<<" "<<i<<"\n";
            return 0;
        }
        m = (m-1)/2*2+1;
        cout<<n+m-1<<"\n";
        for(int i = 1;i <= n;i++) cout<<i<<" 1\n"<<i<<" "<<m<<"\n";
        int fr = n/2+2,to = m-n/2-1;
        for(int i = fr;i <= to;i+=2) cout<<n/2<<" "<<i<<"\n"<<n/2+1<<" "<<i<<"\n";
        return 0;
    }
    swap(n,m);
    if(n & 1)
    {
        cout<<n+m-1<<"\n";
        for(int i = 1;i <= n;i++) cout<<"1 "<<i<<"\n"<<m<<" "<<i<<"\n";
        int fr = (n+1)/2+1,to = m-(n+1)/2;
        for(int i = fr;i <= to;i++) cout<<i<<" "<<(n+1)/2<<"\n";
        return 0;
    }
    m = (m-1)/2*2+1;
    cout<<n+m-1<<"\n";
    for(int i = 1;i <= n;i++) cout<<"1 "<<i<<"\n"<<m<<" "<<i<<"\n";
    int fr = n/2+2,to = m-n/2-1;
    for(int i = fr;i <= to;i+=2) cout<<i<<" "<<n/2<<"\n"<<i<<" "<<n/2+1<<"\n";
    return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3612kb

input:

2 5

output:

result:

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

Test #2:

score: 0

Accepted

time: 0ms

memory: 3636kb

input:

5 5

output:

result:

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

Test #3:

score: 0

Accepted

time: 13ms

memory: 3700kb

input:

100000 100000

output:

result:

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

Test #4:

score: 0

Accepted

time: 13ms

memory: 3552kb

input:

100000 99999

output:

result:

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

Test #5:

score: 0

Accepted

time: 9ms

memory: 3600kb

input:

100000 50000

output:

result:

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

Test #6:

score: 0

Accepted

time: 6ms

memory: 3556kb

input:

1 100000

output:

result:

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

Test #7:

score: 0

Accepted

time: 7ms

memory: 3580kb

input:

34535 99889

output:

result:

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

Test #8:

score: 0

Accepted

time: 6ms

memory: 3640kb

input:

12231 97889

output:

result:

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

Test #9:

score: 0

Accepted

time: 10ms

memory: 3616kb

input:

10000 100000

output:

result:

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

Test #10:

score: 0

Accepted

time: 9ms

memory: 3640kb

input:

13 99999

output:

result:

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

Test #11:

score: 0

Accepted

time: 6ms

memory: 3596kb

input:

21 99999

output:

result:

ok n: 21, m: 99999, bishops: 100019

Test #12:

score: 0

Accepted

time: 8ms

memory: 3640kb

input:

49999 100000

output:

result:

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

Test #13:

score: 0

Accepted

time: 12ms

memory: 3616kb

input:

33333 99999

output:

result:

ok n: 33333, m: 99999, bishops: 133331

Test #14:

score: 0

Accepted

time: 11ms

memory: 3660kb

input:

23342 98876

output:

result:

ok n: 23342, m: 98876, bishops: 122216

Test #15:

score: 0

Accepted

time: 7ms

memory: 3644kb

input:

56713 91234

output:

result:

ok n: 56713, m: 91234, bishops: 147946

Test #16:

score: 0

Accepted

time: 13ms

memory: 3580kb

input:

99995 99995

output:

result:

ok n: 99995, m: 99995, bishops: 199988

Test #17:

score: 0

Accepted

time: 6ms

memory: 3616kb

input:

12345 54321

output:

result:

ok n: 12345, m: 54321, bishops: 66665

Test #18:

score: 0

Accepted

time: 13ms

memory: 3612kb

input:

90000 92000

output:

result:

ok n: 90000, m: 92000, bishops: 181998

Test #19:

score: 0

Accepted

time: 7ms

memory: 3632kb

input:

10000 70000

output:

result:

ok n: 10000, m: 70000, bishops: 79998

Test #20:

score: 0

Accepted

time: 7ms

memory: 3616kb

input:

10000 70001

output:

result:

ok n: 10000, m: 70001, bishops: 80000

Test #21:

score: 0

Accepted

time: 8ms

memory: 3640kb

input:

10000 80000

output:

result:

ok n: 10000, m: 80000, bishops: 89998

Test #22:

score: 0

Accepted

time: 5ms

memory: 3636kb

input:

10000 80001

output:

result:

ok n: 10000, m: 80001, bishops: 90000

Test #23:

score: 0

Accepted

time: 4ms

memory: 3640kb

input:

10000 80002

output:

result:

ok n: 10000, m: 80002, bishops: 90000

Test #24:

score: 0

Accepted

time: 8ms

memory: 3644kb

input:

10000 79999

output:

result:

ok n: 10000, m: 79999, bishops: 89998

Test #25:

score: 0

Accepted

time: 8ms

memory: 3704kb

input:

10000 79998

output:

result:

ok n: 10000, m: 79998, bishops: 89996

Test #26:

score: 0

Accepted

time: 10ms

memory: 3616kb

input:

11111 100000

output:

result:

ok n: 11111, m: 100000, bishops: 111110

Test #27:

score: -100

Wrong Answer

time: 1ms

memory: 3656kb

input:

1 1

output:

0
1 1

result:

wrong answer Participant's answer is not optimal (0 < 1)