oj.uz

Submission #1004646

# Submission time Handle Problem Language Result Execution time Memory
1004646 2024-06-21T11:14:28 Z Valaki2 Calvinball championship (CEOI15_teams) C++14
100 / 100
 277 ms 700 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int mod = 1e6 + 7;

void solve() {
    int n;
    cin >> n;
    vector<int> v(1 + n, 0);
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    vector<int> prefmax(1 + n, 0);
    for(int i = 1; i <= n; i++) {
        prefmax[i] = max(prefmax[i - 1], v[i]);
    }
    vector<int> dp(1 + n, 0);
    for(int i = 1; i <= n; i++) {
        dp[i] = 1;
    }
    int ans = 0;
    for(int i = n; i >= 1; i--) {
        for(int j = 1; j <= v[i] - 1; j++) {
            ans += dp[max(j, prefmax[i  -1])];
            ans %= mod;
        }
        for(int j = 1; j <= i - 1; j++) {
            dp[j] = dp[j] * j + dp[j + 1];
            dp[j] %= mod;
        }
    }
    ans++;
    ans %= mod;
    cout << ans << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

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 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 0 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 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 #6
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 344 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 3 ms 344 KB Output is correct

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 700 KB Output is correct
2 Correct 90 ms 600 KB Output is correct
3 Correct 277 ms 600 KB Output is correct