제출 #448229

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448229		hizuna	마스코트 (JOI13_mascots)	C++17	100 / 100	375 ms	207308 KiB

mascots

#include <bits/stdc++.h>

using namespace std;
using lint = long long;

const lint mod = 1e9 + 7;

int R, C, N;
lint f[3007][3007], fact[9000003], inv_fact[9000003], res;

lint modexp(lint a, lint b) {
    lint ans = 1;
    while(b > 0) {
        if(b % 2) ans = ans * a % mod;
        a = a * a % mod, b /= 2;
    }
    return ans;
}

lint F(int x, int y) {
    if(x > R || y > C) return 0;
    if(x == R && y == C) return 1;
    if(f[x][y]) return f[x][y];

    lint fw = F(x + 1, y) * fact[y] % mod;
    lint fh = F(x, y + 1) * fact[x] % mod;
    return f[x][y]= (fw + fh) % mod;
}

void set_fact(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++)
        fact[i] = fact[i - 1] * i % mod;

    inv_fact[n] = modexp(fact[n], mod - 2);
    for(int i = n; i >= 1; i--)
        inv_fact[i - 1] = inv_fact[i] * i % mod;
}

lint nCr(int n, int r) {
    if(r > n) return 0;
    return fact[n] * inv_fact[n - r] % mod * inv_fact[r] % mod;
}

int main() {
    scanf("%d%d%d", &R, &C, &N);
    set_fact(R * C);
    int x1 = R + 1, y1 = C + 1, x2 = 0, y2 = 0;
    
    for(int i = 0; i < N; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        x1 = min(x1, x), y1 = min(y1, y);
        x2 = max(x2, x), y2 = max(y2, y);
    }

    res = F(x2 - x1 + 1, y2 - y1 + 1) % mod;
    res = res * fact[(x2 - x1 + 1) * (y2 - y1 + 1) - N] % mod;
    res = res * nCr(R - (x2 - x1 + 1), x1 - 1) % mod;
    res = res * nCr(C - (y2 - y1 + 1), y1 - 1) % mod;
    
    printf("%lld\n", res);
    
    return 0;
}

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

mascots.cpp: In function 'int main()':
mascots.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     scanf("%d%d%d", &R, &C, &N);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
mascots.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         scanf("%d%d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 60 / 60