oj.uz

Submission #856609

# Submission time Handle Problem Language Result Execution time Memory
856609 2023-10-04T03:50:29 Z NeroZein Calvinball championship (CEOI15_teams) C++17
100 / 100
 95 ms 604 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int md = 1000007;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> till(n); 
  for (int i = 0; i < n; ++i) {
    cin >> a[i]; 
  }
  for (int i = 1; i < n; ++i) {
    till[i] = max(till[i - 1], a[i - 1]); 
  }
  vector<int> dp(n + 1), pd(n + 1); 
  for (int i = 1; i <= n; ++i) {
    pd[i] = 1; 
  }
  int ans = 1; 
  for (int i = n - 1; i >= 0; --i) {
    ans += ((long long) pd[till[i]] * (a[i] - 1)) % md; 
    if (ans >= md) {
      ans -= md; 
    }
    for (int j = 1; j < i; ++j) {
      dp[j] = ((long long) pd[j] * j + pd[j + 1]) % md;
    }
    swap(dp, pd); 
  }
  cout << ans << '\n'; 
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 452 KB Output is correct

Subtask #7
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 #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 604 KB Output is correct
2 Correct 95 ms 600 KB Output is correct
3 Correct 90 ms 600 KB Output is correct