Submission #810890

#	Time	Username	Problem	Language	Result	Execution time	Memory
810890		JakobZorz	Calvinball championship (CEOI15_teams)	C++14	30 / 100	6 ms	8148 KiB

teams

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <limits.h>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <cstring>
#include <sstream>
 
#pragma GCC target("popcnt")
 
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e6+7;
typedef pair<ll,ll>point;
//#define x first
//#define y second

int n;
int arr[10000];
ll dp[1001][1003];
 
int main(){
    ios::sync_with_stdio(false);
    cout.tie(NULL);
    cin.tie(NULL);
    
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>arr[i];
        arr[i]--;
    }
    
    for(int teams=0;teams<=n+2;teams++)
        dp[n][teams]=1;
    
    for(int i=n-1;i>=0;i--){
        for(int teams=n+1;teams>=0;teams--){
            
            dp[i][teams]+=teams*dp[i+1][teams];
            dp[i][teams]+=dp[i+1][teams+1];
            dp[i][teams]%=MOD;
        }
    }
    
    ll res=1;
    
    int teams=0;
    for(int i=0;i<n;i++){
        teams=max(teams,arr[i]);
        
        res+=arr[i]*dp[i+1][teams];
        res%=MOD;
    }
    
    cout<<res<<"\n";
    
    return 0;
}

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