oj.uz

답안 #415727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
415727 2021-06-01T12:18:12 Z dolphingarlic Chess Rush (CEOI20_chessrush) C++14
100 / 100
 1253 ms 226036 KB 
#include <bits/stdc++.h>

#include "arithmetics.h"
typedef long long ll;
using namespace std;

const int MOD = 1e9 + 7;

int pow(int base, int exp) {
    base %= MOD;
    int result = 1;
    while (exp > 0) {
        if (exp & 1) result = (1ll * result * base) % MOD;
        base = (1ll * base * base) % MOD;
        exp >>= 1;
    }
    return result;
}

pair<int, int> solve_bishop(int x, int y, int r, int c) {
    int moves = 1 + (r - x + c - 2) / (c - 1);
    x--, y--;
    int end_col = 1 + (r - x + c - 3) % (c - 1);
    if (moves & 1) y = c - y - 1;
    int rem;
    if (end_col <= y)
        rem = (y - end_col) / 2;
    else {
        moves++;
        rem = c - 1 - (end_col + y) / 2;
    }
    int ways = 1;
    for (int i = 1; i <= rem; i++)
        ways = Div(Mul(ways, moves + rem - 1 - i), i);
    return {moves, ways};
}

int dp[1002][1002], nxt[1002][1002];

void precompute_king(int r, int c) {
    vector<vector<int>> nxt(c + 2, vector<int>(c + 2, 0));
    if (r == 2) {
        for (int i = 1; i <= c; i++)
            nxt[i][i - 1] = nxt[i][i] = nxt[i][i + 1] = 1;
        for (int i = 1; i <= c; i++)
            nxt[i][0] = nxt[i][c + 1] = nxt[0][i] = nxt[c + 1][i] = 0;
    } else if (r & 1) {
        precompute_king(r / 2 + 1, c);
        for (int j = 1; j <= c; j++)
            for (int k = 1; k <= c; k++) {
                nxt[1][j] = Add(nxt[1][j], Mul(dp[1][k], dp[k][j]));
                nxt[j][1] = nxt[1][j];
            }
        for (int i = 2; i <= c; i++)
            for (int j = 2; j <= c; j++)
                if (i + j <= c + 1)
                    nxt[i][j] = Add(nxt[i - 1][j - 1], nxt[1][i + j - 1]);
        for (int i = 2; i <= c; i++)
            for (int j = 2; j <= c; j++)
                if (i + j > c + 1)
                    nxt[i][j] = nxt[c + 1 - i][c + 1 - j];
    } else {
        precompute_king(r - 1, c);
        for (int i = 1; i <= c; i++)
            for (int j = 1; j <= c; j++)
                nxt[i][j] = Add(dp[i][j - 1], Add(dp[i][j], dp[i][j + 1]));
    }
    for (int i = 1; i <= c; i++)
        for (int j = 1; j <= c; j++)
            dp[i][j] = nxt[i][j];
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int r, c, q;
    cin >> r >> c >> q;
    precompute_king(r, c);
    while (q--) {
        char p;
        int x, y;
        cin >> p >> x >> y;
        switch (p) {
            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;
                    // Extremities
                    if (r == c && (y == 1 || y == r || x == 1 || x == r))
                        ways++;
                    if (x + y + r & 1) {
                        // Double diagonal
                        if (r - x < y) ways++;
                        if (r - c + x - 1 < c - y + 1) ways++;
                    }
                    cout << "2 " << ways << '\n';
                }
                break;
            case 'B':
                if (x + y + r & 1) {
                    if (r == c && ((x == 1 && y == c) || (x == c && y == 1)))
                        cout << "1 1\n";
                    else {
                        pair<int, int> move_left = solve_bishop(x, y, r, c);
                        pair<int, int> move_right =
                            solve_bishop(c - x + 1, c - y + 1, r, c);
                        if (move_left.first > move_right.first)
                            move_left = move_right;
                        else if (move_left.first == move_right.first) {
                            move_left.second = Add(move_left.second, move_right.second);
                        }
                        cout << move_left.first << ' ' << move_left.second
                             << '\n';
                    }
                } else
                    cout << "0 0\n";
                break;
            case 'K':
                cout << r - 1 << ' ' << dp[x][y] << '\n';
                break;
        }
    }
    return 0;
}

Compilation message

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

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 520 ms 82268 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 38 ms 9036 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 462 ms 71512 KB Output is correct
6 Correct 218 ms 33224 KB Output is correct
7 Correct 5 ms 588 KB Output is correct
8 Correct 1194 ms 198228 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 25 ms 2208 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 4 ms 1212 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 2 ms 332 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 4 ms 1212 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 4 ms 1020 KB Output is correct
8 Correct 5 ms 1100 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 4 ms 1212 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 4 ms 1020 KB Output is correct
8 Correct 5 ms 1100 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 13 ms 3184 KB Output is correct
12 Correct 12 ms 2924 KB Output is correct
13 Correct 3 ms 684 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #8
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 4 ms 1212 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 4 ms 1020 KB Output is correct
8 Correct 5 ms 1100 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 13 ms 3184 KB Output is correct
12 Correct 12 ms 2924 KB Output is correct
13 Correct 3 ms 684 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 3 ms 736 KB Output is correct
17 Correct 1228 ms 198276 KB Output is correct
18 Correct 1253 ms 226024 KB Output is correct
19 Correct 881 ms 164548 KB Output is correct
20 Correct 1047 ms 170528 KB Output is correct

Subtask #9
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 520 ms 82268 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 38 ms 9036 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 462 ms 71512 KB Output is correct
12 Correct 218 ms 33224 KB Output is correct
13 Correct 5 ms 588 KB Output is correct
14 Correct 1194 ms 198228 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 25 ms 2208 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 4 ms 1212 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 4 ms 1020 KB Output is correct
24 Correct 5 ms 1100 KB Output is correct
25 Correct 3 ms 588 KB Output is correct
26 Correct 3 ms 716 KB Output is correct
27 Correct 13 ms 3184 KB Output is correct
28 Correct 12 ms 2924 KB Output is correct
29 Correct 3 ms 684 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 3 ms 736 KB Output is correct
33 Correct 1228 ms 198276 KB Output is correct
34 Correct 1253 ms 226024 KB Output is correct
35 Correct 881 ms 164548 KB Output is correct
36 Correct 1047 ms 170528 KB Output is correct
37 Correct 1061 ms 190376 KB Output is correct
38 Correct 1245 ms 226036 KB Output is correct
39 Correct 1098 ms 202268 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 927 ms 178236 KB Output is correct
42 Correct 2 ms 332 KB Output is correct