Submission #386318

#	Time	Username	Problem	Language	Result	Execution time	Memory
386318		FatihSolak	Calvinball championship (CEOI15_teams)	C++17	70 / 100	20 ms	16492 KiB

teams

#include <bits/stdc++.h>
#define N 1005
#define mod 1000007
using namespace std;
long long dp[N][N];
int arr[N];
void solve(){
    int n;
    cin >> n;
    for(int i= 0;i<N;i++)dp[0][i] = 1;
    for(int i=1;i<N;i++){
        for(int j=1;j<N;j++){
            dp[i][j] = (dp[i-1][j] * j) % mod;
            if(j != N-1){
                dp[i][j] = (dp[i][j] + dp[i-1][j+1]) % mod;
            }
        }
    }
    int maxi = 0;
    long long ans = 1;
    for(int i=1;i<=n;i++){
        cin >> arr[i];
        if(arr[i] != 1){
            ans = (ans + dp[n-i][maxi] * (arr[i]-1))%mod;
        }
        maxi = max(maxi,arr[i]);
    }
    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    #ifdef Local
    cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

• 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