제출 #210749

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210749		johutha	Calvinball championship (CEOI15_teams)	C++14	70 / 100	53 ms	65540 KiB

teams

#include <iostream>
#include <vector>
#include <algorithm>

#define int int64_t
#define MOD (int)(1e6+7)

using namespace std;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;

    vector<int> ip(n);
    for (int i = 0; i < n; i++)
    {
        cin >> ip[i];
    }

    vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0));
    vector<vector<int>> st(n + 1, vector<int>(n + 2, 0));
    for (int i = 0; i < n + 2; i++) st[0][i] = 1;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            dp[i][j] = (dp[i - 1][j] + st[i - 1][j + 1]) * j;
            st[i][j] = dp[i - 1][j] + st[i - 1][j + 1];
            dp[i][j] %= MOD;
            st[i][j] %= MOD;
        }
    }
    int res = 0;
    int mmax = 0;
    for (int i = 0; i < n; i++)
    {
        int base = ip[i] - 1;
        for (int j = n - i - 1; j >= 0; j--)
        {
            // cerr << i << " " << j << " " << base << "\n";
            res += base*st[j][mmax + 1];
            base *= mmax;
            base %= MOD;
            res %= MOD;
        }
        mmax = max(mmax, ip[i]);
    }
    cout << (res + 1) << "\n";
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10