제출 #258979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
258979		Haunted_Cpp	Calvinball championship (CEOI15_teams)	C++17	0 / 100	857 ms	584 KiB

teams

/**
 *  author: Haunted_Cpp
**/
 
#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
template<typename T> ostream &operator << (ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream &operator << (ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream &operator << (ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
 
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
 
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif

const int N = 1e4 + 5;
const int MOD = 1e6 + 7;

int dp[2][N];

int add(int a, int b) {
  int res = a + b;
  if (res >= MOD) res -= MOD;
  return res;
}

int mult(int a, int b) {
  long long res = 1LL * a * b;
  if (res >= MOD) res %= MOD;
  return res;
}

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> arr(n);
  for (int i = 0; i < n; i++) cin >> arr[i];
  dp[0][1] = 1;
  for (int i = 1; i < n; i++) {
    vector<int> pre(n + 1);
    for (int j = 1; j <= n; j++) pre[j] = add(pre[j - 1], dp[(i - 1) & 1][j]);
    for (int j = 1; j <= n; j++) {
      if (j <= arr[i]) dp[i & 1][j] = add(dp[i & 1][j], pre[j - 1]);
      dp[i & 1][j] = add(dp[i & 1][j], mult(dp[(i - 1) & 1][j], min(j, arr[i])));
    }
    for (int j = 1; j <= n; j++) {
      dp[(i + 1) & 1][j] = 0;
    }
  }
  int res = 0;
  for (int i = 1; i <= n; i++) res = add(res, dp[(n - 1) & 1][i]);
  cout << res << '\n';
  return 0;
}

• 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