QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#306671#7178. Bishopsfikusm9WA 20ms5236kbC++141.1kb2024-01-17 00:48:552024-01-17 00:48:56

Judging History

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

  • [2024-01-17 00:48:56]
  • 评测
  • 测评结果:WA
  • 用时:20ms
  • 内存:5236kb
  • [2024-01-17 00:48:55]
  • 提交

answer

#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define maxn 100050

using namespace std;
typedef long long ll;

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

int main()
{
   ios::sync_with_stdio(0);
   cin.tie(0);
   cin >> n >> m;
   bool zamena=false;
   if(n>m){
        swap(n,m);
        zamena=true;
   }
   if(n==m){
        cout << n+m-2 << "\n";
        for(int i=1; i<=n; i++){
            cout << i << " " << 1 << "\n";
        }
        for(int i=2; i<=n-1; i++){
            cout << i << " " << n << "\n";
        }
        return 0;
    }
    for(int i=1; i<=n; i++){
        v.pb({i,1});
        v.pb({i,m});
    }
    if(n%2==1){
        for(int i=(n+1)/2+1; i<m-(n+1)/2; i++) v.pb({(n+1)/2, i});
    }
    else{
        for(int i=n/2+2; i<m-n/2; i+=2) {
            v.pb({n/2,i});
            v.pb({n/2+1,i});
        }
    }
    if(zamena){
        for(int i=0; i<v.size(); i++){
            swap(v[i].fi,v[i].se);
        }
    }
    cout << v.size() << "\n";
    for(auto u:v) cout << u.fi << " " << u.se << "\n";
}

詳細信息

Test #1:

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

input:

2 5

output:

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

result:

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

Test #2:

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

input:

5 5

output:

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

result:

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

Test #3:

score: 0
Accepted
time: 18ms
memory: 3564kb

input:

100000 100000

output:

199998
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: 100000, m: 100000, bishops: 199998

Test #4:

score: 0
Accepted
time: 20ms
memory: 5236kb

input:

100000 99999

output:

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

result:

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

Test #5:

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

input:

100000 50000

output:

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

result:

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

Test #6:

score: -100
Wrong Answer
time: 6ms
memory: 4100kb

input:

1 100000

output:

99999
1 1
1 100000
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...

result:

wrong answer Participant's answer is not optimal (99999 < 100000)