oj.uz

Submission #713670

# Submission time Handle Problem Language Result Execution time Memory
713670 2023-03-22T19:22:27 Z stevancv Calvinball championship (CEOI15_teams) C++14
100 / 100
 151 ms 520 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e4 + 2;
const int mod = 1e6 + 7;
const int inf = 1e9;
int Add(int a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    return a;
}
int Mul(int a, int b) {
    ll c = a; c *= b; c %= mod;
    return c;
}
int dp[N], novo[N];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    int mx = 1;
    for (int i = 1; i <= n; i++) {
        int x; cin >> x;
        if (i == 1) continue;
        for (int j = 1; j <= i; j++) {
            novo[j] = 0;
            novo[j] = Add(dp[j - 1], Mul(dp[j], j));
        }
        novo[mx] = Add(novo[mx], x - 1);
        for (int j = 1; j <= i; j++) dp[j] = novo[j];
        smax(mx, x);
    }
    int ans = 1;
    for (int i = 1; i <= n; i++) ans = Add(ans, dp[i]);
    cout << ans << en;
    return 0;
}

Subtask #1
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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 360 KB Output is correct
2 Correct 38 ms 376 KB Output is correct
3 Correct 38 ms 368 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 520 KB Output is correct
2 Correct 146 ms 412 KB Output is correct
3 Correct 151 ms 404 KB Output is correct