Submission #746967

#	Time	Username	Problem	Language	Result	Execution time	Memory
746967		vjudge1	Calvinball championship (CEOI15_teams)	C++14	100 / 100	251 ms	716 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>;
vector<int>A(10001,-1),B(10001,-1);
int slv(int a,int b){
    if(b==0)return A[a]=1;
    return A[a]=(B[a+1]+B[a]*a)%1000007;
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    int arr[n];
    for(auto &i:arr)cin>>i;
    int ans=1;
    int mx[n];
    for(int i=0;i<n;i++)mx[i]=max((i==0?0:mx[i-1]),arr[i]);
    for(int i=n-1;i>=0;i--){
        for(int w=1;w<=n;w++)slv(w,n-i-1);
        ans+=(slv((i==0?1:mx[i-1]),n-i-1)*(arr[i]-1))%1000007;
        ans%=1000007;
        B=A;
    }
    cout<<ans;
}

• 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