제출 #136695

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
136695		choikiwon	A Huge Tower (CEOI10_tower)	C++17	85 / 100	1067 ms	18552 KiB

tower

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

const int mod = 1e9 + 9;

int N, D;
vector<int> fact, A, B;
vector<int> dp[2];

int main() {
    scanf("%d %d", &N, &D);

    fact.resize(N + 1);
    fact[0] = 1;
    for(int i = 1; i <= N; i++) {
        fact[i] = 1LL * fact[i - 1] * i % mod;
    }

    A.resize(N);
    for(int i = 0; i < N; i++) {
        scanf("%d", &A[i]);
    }

    sort(A.begin(), A.end());

    B.resize(N);
    int pos = N - 1;
    for(int i = N - 1; i >= 0; i--) {
        while(pos >= 0 && A[pos] > A[i] + D) pos--;
        B[i] = N - 1 - pos;
    }

    dp[0] = dp[1] = vector<int>(N);

    for(int i = 0; i < N; i++) {
        dp[1][i] = i % 2? mod - fact[N - i] : fact[N - i];
    }
    for(int i = 0; i < N; i++) {
        int c = i & 1;
        int p = c ^ 1;
        for(int j = 0; j < N; j++) {
            int &ret = dp[c][j] = 0;
            ret += dp[p][j];
            ret %= mod;
            if(B[i] > j) {
                ret += 1LL * dp[p][j + 1] * (B[i] - j) % mod;
                ret %= mod;
            }
        }
    }
    printf("%d", dp[(N - 1) & 1][0]);
}

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

tower.cpp: In function 'int main()':
tower.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &D);
     ~~~~~^~~~~~~~~~~~~~~~~
tower.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]);
         ~~~~~^~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5