Submission #55200

#	Time	Username	Problem	Language	Result	Execution time	Memory
55200		istlemin	Calvinball championship (CEOI15_teams)	C++14	100 / 100	245 ms	1132 KiB

teams

#include<bits/stdc++.h>

using namespace std;

#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;

int main(){
	cin.sync_with_stdio(false);
    ll n;
    cin>>n;
    vi v(n);
    rep(i,0,n) cin>>v[i];



	vector<pii> ansTerms(n+1);
    ll numTeams = 1;
    rep(i,0,n){
		ansTerms[n-i-1] = {v[i]-1,numTeams};
		//ans = (ans + (v[i]-1)*dp[n-i-1][numTeams])%mod;
        numTeams = max(v[i],numTeams);
    }

    ll mod = 1e6+7;

    ll ans = 0;

    vector<ll> dpLast(n+1,1);
	ans = (ans + ansTerms[0].first*dpLast[ansTerms[0].second])%mod;
    rep(left,1,n+1){
		vector<ll> dpNew(n-left+1);
		rep(numTeams,1,n-left+1)
			dpNew[numTeams] = (numTeams*dpLast[numTeams] + dpLast[numTeams+1])%mod;
		ans = (ans + ansTerms[left].first*dpNew[ansTerms[left].second])%mod;
        dpLast = dpNew;
	}


    cout<<(ans+1)%mod<<endl;
}

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