# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
136692 | choikiwon | A Huge Tower (CEOI10_tower) | C++17 | 58 ms | 16116 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 9;
int N, D;
vector<int> fact, A, B;
vector<vector<int> > cc;
int dp(int x, int cnt) {
if(x == -1) return cnt % 2? mod - fact[N - cnt] : fact[N - cnt];
int &ret = cc[x][cnt];
if(ret != -1) return ret;
ret = 0;
ret += dp(x - 1, cnt);
ret %= mod;
if(B[x] > cnt) {
ret += 1LL * dp(x - 1, cnt + 1) * (B[x] - cnt) % mod;
ret %= mod;
}
return ret;
}
int main() {
scanf("%d %d", &N, &D);
if(N > 5000) {
return 0;
}
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;
}
cc = vector<vector<int> >(N, vector<int>(N + 1, -1));
printf("%d", dp(N - 1, 0));
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |