제출 #860348

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
860348		sofijavelkovska	Chess Rush (CEOI20_chessrush)	C++14	0 / 100	1 ms	600 KiB

chessrush

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

int m, n;

int queendiagonal(int x, int y)
{
    if (y<x)
        swap(x, y);
    if ((m+y-x-1)%2==1)
        return 0;
    int a=(m+y-x-1)/2;
    int b=m-1-a;
    if (x+a<=n && x-b>=1)
        return 2;
    if (x+a<=n || x-b>=1)
        return 1;

    return 0;
}

int main()
{
    int q, x, y;
    char type;
    cin >> m >> n >> q;
    while (q--)
    {
        cin >> type >> x >> y;
        if (type=='P')
        {
            if (x==y)
                cout << 1 << " " << 1 << '\n';
            else
                cout << 0 << " " << 0 << '\n';
        }
        if (type=='R')
        {
            if (x==y)
                cout << 1 << " " << 1 << '\n';
            else
                cout << 2 << " " << 2 << '\n';
        }
        if (type=='Q')
        {
            if (x==y)
                cout << 1 << " " << 1 << '\n';
            else
                cout << 2 << " " << 4+queendiagonal(x, y) << '\n';
        }
    }

    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 8
• Subtask 3: 0 / 15
• Subtask 4: 0 / 22
• Subtask 5: 0 / 5
• Subtask 6: 0 / 8
• Subtask 7: 0 / 15
• Subtask 8: 0 / 20
• Subtask 9: 0 / 7