제출 #527212

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527212		beepbeepsheep	Calvinball championship (CEOI15_teams)	C++17	20 / 100	91 ms	65540 KiB

teams

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

#define ll long long
#define ii pair<ll,ll>
#define endl '\n'
const ll inf=1e15;
const ll mod=1e6+7;
const ll maxn=105;

vector<short> dp[maxn][maxn];
void solve(ll digit, ll rem){
    if (dp[digit][rem].size()) return;
    if (dp[digit][rem-1].empty()){
        solve(digit,rem-1);
    }
    for (auto u:dp[digit][rem-1]){
        for (int i=0;i<u;i++){
            dp[digit][rem].push_back(u);
        }
        dp[digit][rem].push_back(u+1);
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,ele,ans=0;
    for (int i=1;i<=104;i++){
        dp[i][0].emplace_back(i);
    }
    cin>>n;
    ll ele2=0,temp;
    for (int i=1;i<=n;i++){
        cin>>ele;
        for (int j=1;j<ele;j++){
            temp=max<ll>(j,ele2);
            solve(temp,n-i);
            ans+=dp[temp][n-i].size();
            ans%=mod;
        }
        ele2=max(ele,ele2);
    }
    cout<<(ans+1)%mod;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 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