제출 #405403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405403		MeGustaElArroz23	Calvinball championship (CEOI15_teams)	C++14	70 / 100	39 ms	65540 KiB

teams

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;

const ll mod=1000007;

ll power(int a, int b){
    if (b==0) return 1;
    ll sol=power(a,b/2)%mod;
    sol=sol*sol%mod;
    if (b%2) sol*=a;
    cerr << a <<' '<<b<<' '<<sol<<'\n';
    return sol%mod;
}

int main(){
    
    ll n;
    cin >> n;
    
    vvi sol(n+1,vi(n+1,1));  //sol[n][x]
    for (ll i=1;i<=n;i++) sol[1][i]=i+1;
    for (ll i=2;i<=n;i++){
        for (ll j=1;j<=n-i+1;j++) sol[i][j]=(j*sol[i-1][j]+sol[i-1][j+1])%mod;
    }
    
    vi v(n);
    for (ll i=n-1;i>=0;i--) cin >> v[i];
    ll res=0;
    ll maxvisto=0;
    for (ll i=n-1;i>=0;i--){
        res+=(v[i]-1)*sol[i][maxvisto]%mod;
        maxvisto=max(v[i],maxvisto);
        //cerr << i << ' ' << v[i] <<' '<< res << '\n';
    }
    cout <<(res+1)%mod<<'\n';
}

• 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