Submission #746924

#	Time	Username	Problem	Language	Result	Execution time	Memory
746924		vjudge1	Calvinball championship (CEOI15_teams)	C++14	0 / 100	40 ms	65536 KiB

teams

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
int SLV[10011][10011];
int arr[10011];
int slv(int a,int b){
    if(b==0)return 1;
    if(SLV[a][b]!=-1)return SLV[a][b];
    return SLV[a][b]=(slv(a+1,b-1)+slv(a,b-1)*a)%1000000007;
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t=1;
    // t=INT_MAX;
    while(t--){
        memset(SLV,-1,sizeof SLV);
        int n=5;
        cin>>n;
        for(int a=n;a>=1;a--){
            for(int b=0;b<=n;b++){
                if(b==0)SLV[a][b]=1;
                else SLV[a][b]=(SLV[a+1][b-1]+SLV[a][b-1]*a)%1000000007;
            }
        }
        for(int i=0;i<n;i++)cin>>arr[i];
        int ans=1;
        int mx=0;
        for(int i=0;i<n;i++){
            for(int w=1;w<arr[i];w++)ans+=SLV[max(mx,w)][n-i-1];
            mx=max(mx,arr[i]);
            ans%=1000000007;
        }
        cout<<ans<<endl;
    }
}
/*
1 1 1 1
1 1 1 2
1 1 2 1
1 1 2 2
1 1 2 3
1 2 1 1
1 2 1 2
1 2 1 3
1 2 2 1
1 2 2 2
1 2 2 3
1 2 3 1
1 2 3 2
1 2 3 3
1 2 3 4
*/

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