Submission #1218140

#	Time	Username	Problem	Language	Result	Execution time	Memory
1218140		__moin__	Chess Rush (CEOI20_chessrush)	C++20	0 / 100	0 ms	324 KiB

chessrush

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

#define int long long
const int p = 1e9+7;

__int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0);

    int r, c, q; cin >> r >> c >> q;
    for (int i = 0; i < q; i++) {
        char t; int in, out; cin >> t >> in >> out;
        switch (t) {
        case 'P':
            if (in != out) {
                cout << "0 0\n";
                break;
            }
            cout << r-1 << "\n";
            break;
        case 'R':
            if (in == out) {
                cout << "1 1\n";
            } else {
                cout << "2 2\n";
            }
            break;
        case 'Q':
            if (in == out) {
                cout << "1 1\n";
            } else if (r == c && (in == 1 || in == c) && (out == 1 || out == c)) {
                cout << "1 1\n";
            } else {
                // int diag1phi = (1+i-r-out);
                // int cnt = 0;
                // int diag2phi = -diag1phi;
                // if ((diag1phi & 1) == 0) {
                //     if (1+diag1phi/2 <= c) cnt++;
                //     if (1+diag2phi/2 >= 1) cnt++;
                // }
                int cnt = 0;
                int k1 = 1-in;
                int k2 = r+out;
                int x1 = k1+k2;
                if ((x1 & 1) == 0 && (k2-x1/2) <= c) cnt++;
                int k3 = 1+in;
                int k4 = r-out;
                int x2 = k3+k4;
                if ((x2 & 1) == 0 && (k3-x2/2) >= 1) cnt++;
                cout << "2 " << (4 + cnt) << "\n";
            }
            break;
        default:
            // return 1;
            break;
        }
    }

    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