제출 #546297

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
546297		Soumya1	Calvinball championship (CEOI15_teams)	C++17	20 / 100	340 ms	468 KiB

teams

#include <bits/stdc++.h>
#ifdef __LOCAL__
#include <debug_local.h>
#endif
using namespace std;
const int mod = 1e9 + 7;
void testCase() {
  int n;
  cin >> n;
  vector<int> a(n + 1);
  for (int i = 1; i <= n; i++) cin >> a[i];
  vector<int> dp(n + 1, 1);
  vector<int> pre(n + 1);
  for (int i = 1; i <= n; i++) pre[i] = max(pre[i - 1], a[i - 1]);
  int ans = 0;
  for (int i = n; i >= 1; i--) {
    vector<int> new_dp(n + 1);
    for (int j = 1; j <= n; j++) {
      new_dp[j] = (1LL * dp[j] * j + (j + 1 <= n ? dp[j + 1] : 0)) % mod;
    }
    for (int j = 1; j < a[i]; j++) {
      ans += dp[max(pre[i], j)];
      if (ans >= mod) ans -= mod;
    }
    dp = new_dp;
  }
  cout << (ans + 1) % mod << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

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