제출 #409960

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

chessrush

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

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int r, c, q;
    cin >> r >> c >> q;
    while (q--) {
        char c;
        int x, y;
        cin >> c >> x >> y;
        switch (c) {
            case 'P':
                if (x == y)
                    cout << r - 1 << " 1\n";
                else
                    cout << "0 0\n";
                break;
            case 'R':
                if (x == y)
                    cout << "1 1\n";
                else
                    cout << "2 2\n";
                break;
            case 'Q':
                if (x == y || x + r - 1 == y || x - r + 1 == y)
                    cout << "1 1\n";
                else {
                    int ways = 4;
                    if (x + y + r & 1) {
                        if (r - x < y) ways++;
                        if (r - c + x - 1 < y) ways++;
                    }
                    cout << "2 " << ways << '\n';
                }
                break;
            case 'B':
                // Not yet implemented
                cout << "NYI\n";
                break;
            case 'K':
                // Not yet implemented
                cout << "NYI\n";
                break;
        }
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

chessrush.cpp: In function 'int main()':
chessrush.cpp:31:31: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   31 |                     if (x + y + r & 1) {
      |                         ~~~~~~^~~

• 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