Numbers on the Chessboard- Educational Codeforces Round 49 (Rated for Div. 2）B题

最新推荐文章于 2019-07-23 21:03:10 发布

原创最新推荐文章于 2019-07-23 21:03:10 发布 · 174 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#CF

CodeForces 专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一种解决特定二维坐标系中查找规律的问题的方法。通过判断坐标奇偶性及行列值来确定每个点的位置编号，适用于算法竞赛或编程挑战等场景。

思路：
找规律即可。

AC code:
#include<bits/stdc++.h>
using namespace std;

int main(){
    int n = 0,q = 0;
    while(cin >> n >> q){
        int me = 0,mo = 0;
        int start = 0;
        if(n % 2 == 0){
             me = n/2,mo = n/2;
             start = n*n / 2 + 1;
        }else{
            me = (n+1)/2,mo = (n-1)/2;
            start = (n*n + 1)/2+1;
        }
        int x = 0,y = 0;
        for(int i = 0;i < q;++i){
            cin >> x >> y;
            if(n % 2 == 0){
                if((x + y) % 2 == 0){
                    cout << 1 + (x-1)*me + (y-1)/2 <<endl;
                }else{
                    cout << start + (x - 1)*mo + (y - 1)/2 << endl;
                }
            }else{
                if((x + y) % 2 == 0){
                    int sum = (x - 1)/2 * n + x%2 == 0? me : 0;
                    //cout << "en " << sum << endl;
                    cout << 1 + sum + (y-1)/2 <<endl;
                }else{
                    int sum = (x - 1)/2 * n + x%2 == 0? mo : 0;
                    //cout << "en " << sum << endl;
                    cout << start + sum + (y-1)/2 <<endl;
                }   
            }
        }

    }

    return 0;
}