QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#639711#7178. BishopsembuscaWA 0ms3616kbC++201.7kb2024-10-13 21:46:512024-10-13 21:46:52

Judging History

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

  • [2024-10-13 21:46:52]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3616kb
  • [2024-10-13 21:46:51]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rp(i,a,b)        for(int i=a;i<b;i++)

void solvetask(){
    int n, m;
    cin >> n >> m;
    bool flag = false;

    if(n > m){
        swap(n, m);
        flag = true;
    }
    
    vector<pair<int, int>> resp;

    rp(i, 0, n) resp.push_back({1, i+1});
    if(m <= n+1){
        int comp = n+1 - m, t = n - comp*2;
        if(t > 0){
            int d = (n-t)/2;
            rp(i, d, n-d) resp.push_back({m, i+1});
        }
        ll r = resp.size();
        cout << r << "\n";
        for(auto i: resp) if(flag) cout << i.first << " " << i.second << "\n";
        else cout << i.second << " " << i.first << "\n";
        return;
    }

    rp(i, 0, n) resp.push_back({m, i+1});

    if (n % 2 == 0) {
        if(m&1){
            rp(i, n/2 + 1, m - n/2) {
                if ((m-i)% 2 == 0) {
                    resp.push_back({i+1, n/2});
                    resp.push_back({i+1, (n/2)+1});
                }
            }
        }
        else{
            rp(i, n/2 + 1, m - n/2 - 1) {
                if (i% 2 == 0) {
                    resp.push_back({i+1, n/2});
                    resp.push_back({i+1, (n/2)+1});
                }
            }
        }
        
    } else {
        rp(i, (n+1)/2, m - (n+1)/2) {
            resp.push_back({i+1, (n+1)/2});
        }
    }

    ll r = resp.size();
    cout << r << "\n";

    for(auto i: resp) {
        if(flag) cout << i.first << " " << i.second << "\n";
        else cout << i.second << " " << i.first << "\n";
    }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    ll t = 1;
    while(t--) solvetask();
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3616kb

input:

2 5

output:

6
1 1
2 1
1 5
2 5
1 4
2 4

result:

wrong answer Sum diagonals are not distinct