oj.uz

Submission #1086448

# Submission time Handle Problem Language Result Execution time Memory
1086448 2024-09-10T17:07:30 Z juicy Calvinball championship (CEOI15_teams) C++17
100 / 100
 211 ms 856 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 10005, M = 1000007;

void add(int &x, int y) {
  if ((x += y) >= M) {
    x -= M;
  }
}

int n;
int a[N], ma[N], dp[N];

int main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    ma[i] = max(ma[i - 1], a[i - 1]);
  }
  fill(dp + 1, dp + n + 1, 1);
  int res = 1;
  for (int i = n; i >= 1; --i) {
    add(res, (long long) dp[ma[i]] * (a[i] - 1) % M);
    for (int j = 1; j <= n; ++j) {
      dp[j] = (long long) dp[j] * j % M;
      add(dp[j], dp[j + 1]);
    } 
  }
  cout << res;
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 856 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 600 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 520 KB Output is correct
2 Correct 51 ms 348 KB Output is correct
3 Correct 51 ms 528 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 600 KB Output is correct
2 Correct 211 ms 604 KB Output is correct
3 Correct 207 ms 600 KB Output is correct