제출 #1230894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1230894		The_Samurai	Chess Rush (CEOI20_chessrush)	C++20	0 / 100	3 ms	320 KiB

chessrush

#include "bits/stdc++.h"
#include "arithmetics.h"
using namespace std;

constexpr int P = 1e9+7;
int binpow(int base, int exp, int modulus=P) {
    base %= modulus;
    int result = 1;
    while (exp > 0) {
        if (exp & 1) result = (1ll*result * base) % modulus;
        base = (1ll*base * base) % modulus;
        exp >>= 1;
    }
    return result;
}

int c(int n, int k) {
    k = max(k, n - k);
    int ans = 1;
    for (int i = 1; i <= n - k; i++) ans = Mul(ans, i);
    ans = Div(1, ans);
    for (int i = k + 1; i <= n; i++) ans = Mul(ans, i);
    return ans;
}

int main() {
    int n, m, q;
    cin >> n >> m >> q;
    while (q--) {
        char op;
        int c1, c2;
        cin >> op >> c1 >> c2;
        assert(op == 'K');
        int d = abs(c1 - c2);
        int ans = 0;
        for (int i = d; i < n; i += 2) {
            ans = Add(ans, Mul(c(n - 1, i), c(i, (i - d) / 2)));
        }
        cout << n - 1 << ' ' << ans << '\n';
    }
}

• 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