oj.uz

Submission #569952

# Submission time Handle Problem Language Result Execution time Memory
569952 2022-05-28T10:37:20 Z 600Mihnea Calvinball championship (CEOI15_teams) C++17
100 / 100
 229 ms 420 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 10000 + 7;
const int M = 1000007;

int n, a[N], mx[N], ways[N];

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);


  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    mx[i] = max(mx[i - 1], a[i]);
    ways[i] = 1;
  }

  int sol = 1;
  for (int i = n; i >= 1; i--) {
    sol = (sol + 1LL * (a[i] - 1) * (ways[mx[i - 1]])) % M;
    for (int j = 1; j <= n; j++) {
      ways[j] = (1LL * j * ways[j] + ways[j + 1]) % M;
    }
  }
  cout << sol << "\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 340 KB Output is correct
2 Correct 54 ms 372 KB Output is correct
3 Correct 50 ms 376 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 420 KB Output is correct
2 Correct 209 ms 340 KB Output is correct
3 Correct 229 ms 420 KB Output is correct