oj.uz

Submission #1053538

# Submission time Handle Problem Language Result Execution time Memory
1053538 2024-08-11T12:59:59 Z VMaksimoski008 Calvinball championship (CEOI15_teams) C++17
70 / 100
 647 ms 8536 KB 
#include <bits/stdc++.h>
using namespace std;

const int mod = 1e6 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

int n;
vector<int> v;
int dp[1005][1005][2];

int f(int pos, int mx, int under) {
    if(pos == n + 1) return under;
    if(dp[pos][mx][under] != -1) return dp[pos][mx][under];

    int ans = 0;

    for(int i=1; i<=min(pos, mx+1); i++) {
        if(!under && i > v[pos]) continue;
        ans = (ans + f(pos+1, max(mx, i), under|(i<v[pos]))) % mod;
    }

    return dp[pos][mx][under] = ans;
}

signed main() {
    memset(dp, -1, sizeof(dp));

    cin >> n;
    v.resize(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];

    cout << (f(2, 1, 0) + 1) % mod << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 8536 KB Output is correct
2 Correct 78 ms 8280 KB Output is correct
3 Correct 82 ms 8284 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 625 ms 8284 KB Output is correct
2 Correct 617 ms 8408 KB Output is correct
3 Correct 607 ms 8284 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 634 ms 8440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 647 ms 8428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 621 ms 8528 KB Output isn't correct
2 Halted 0 ms 0 KB -