제출 #1053572

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053572		VMaksimoski008	Calvinball championship (CEOI15_teams)	C++17	10 / 100	1059 ms	23632 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[1005][1005][2];

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

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

    dp[1][1][(1<v[1])] = 1;
    for(int i=1; i<n; i++) {
        for(int j=1; j<=i; j++) {
            for(int k=0; k<2; k++) {
                for(int x=1; x<=j+1; x++) {
                    if(!k && x > v[i+1]) break;
                    dp[i+1][max(j, k)][k|(x<v[i+1])] = (dp[i+1][max(j, k)][k|(x<v[i+1])] + dp[i][j][k]) % mod;
                }
            }
        }
    }

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

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