이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long N;
cin >> N;
vector<long long> Tab(N);
for (long long i = 0; i < N; i++)
{
cin >> Tab[i];
}
vector<vector<long long>> dp(N, vector<long long>(N, 1));
for (long long i = N - 2; i >= 0; i--)
{
for (long long j = 0; j <= i; j++)
{
dp[i][j] = (dp[i + 1][j + 1] + (dp[i + 1][j] * (j + 1))) % 1000000007;
}
}
long long tot = 0;
long long maxx = 0;
for (long long i = 0; i < N; i++)
{
maxx = max(maxx, Tab[i]);
tot += (Tab[i] - 1) * dp[i][maxx - 2];
tot = tot % 1000000007;
}
cout << (tot + 1) % 1000000007;
}
# | 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... |