제출 #617456

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
617456		ollel	Calvinball championship (CEOI15_teams)	C++14	0 / 100	48 ms	65536 KiB

teams

#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;

#define rep(i,a,b) for(int i = a; i < b; i++)

const ll MOD = 1000007;
const int MAXN = 10000;

int main() {
  int n; cin >> n;
  vector<vector<ll>> dp(MAXN + 5, vector<ll>(MAXN + 5, 1));
  rep(i,0,MAXN+1) dp[1][i] = i+1;
  rep(x,2,MAXN+1) {
    rep(y,0,MAXN+1) {
      dp[x][y] = (y * dp[x - 1][y] + dp[x - 1][y + 1]) % MOD;
    }
  }

  vi state(n);
  rep(i,0,n) cin >> state[i];

  ll ans = 1;
  int MAX = 1, LEFT = n;

  rep(i,0,n) {
    ans = (ans + (state[i] - 1) * dp[LEFT - 1][MAX]) % MOD;
    MAX = max(MAX, state[i]);
    LEFT--;
  }
  cout << ans << endl;
}

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