제출 #1053583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053583		VMaksimoski008	Calvinball championship (CEOI15_teams)	C++17	70 / 100	1039 ms	600 KiB

teams

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

const int mod = 1e6 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

int dp[2][10005][2];

signed main() {
    int n;
    cin >> n;

    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];

    dp[0][1][0] = 1;
    for(int a=1; a<n; a++) {
        for(int b=1; b<=a; b++) {
            for(int c=0; c<2; c++) {
                if(c) {
                    dp[1][b][1] = (dp[1][b][1] + b * dp[0][b][1]) % mod;
                    dp[1][b+1][1] = (dp[1][b+1][1] + dp[0][b][1]) % mod;
                    continue;
                }
                for(int i=1; i<=b+1; i++) {
                    if(!c && i > v[a+1]) break;
                    dp[1][max(b, i)][c|(i<v[a+1])] = (dp[1][max(b, i)][c|(i<v[a+1])] + dp[0][b][c]) % mod;
                }
            }
        }

        for(int b=1; b<=n; b++) {
            for(int c=0; c<2; c++) {
                dp[0][b][c] = dp[1][b][c];
                dp[1][b][c] = 0;
            }
        }
    }

    long long ans = 0;
    for(int i=1; i<=n; i++) ans = (ans + dp[0][i][1]) % mod;
    cout << (ans + 1) % mod << '\n';
    return 0;
}

• 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