oj.uz

Submission #210749

# Submission time Handle Problem Language Result Execution time Memory
210749 2020-03-18T10:04:22 Z johutha Calvinball championship (CEOI15_teams) C++14
70 / 100
 53 ms 65540 KB 
#include <iostream>
#include <vector>
#include <algorithm>

#define int int64_t
#define MOD (int)(1e6+7)

using namespace std;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;

    vector<int> ip(n);
    for (int i = 0; i < n; i++)
    {
        cin >> ip[i];
    }

    vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0));
    vector<vector<int>> st(n + 1, vector<int>(n + 2, 0));
    for (int i = 0; i < n + 2; i++) st[0][i] = 1;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            dp[i][j] = (dp[i - 1][j] + st[i - 1][j + 1]) * j;
            st[i][j] = dp[i - 1][j] + st[i - 1][j + 1];
            dp[i][j] %= MOD;
            st[i][j] %= MOD;
        }
    }
    int res = 0;
    int mmax = 0;
    for (int i = 0; i < n; i++)
    {
        int base = ip[i] - 1;
        for (int j = n - i - 1; j >= 0; j--)
        {
            // cerr << i << " " << j << " " << base << "\n";
            res += base*st[j][mmax + 1];
            base *= mmax;
            base %= MOD;
            res %= MOD;
        }
        mmax = max(mmax, ip[i]);
    }
    cout << (res + 1) << "\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 16120 KB Output is correct
2 Correct 21 ms 16124 KB Output is correct
3 Correct 21 ms 16120 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 50 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 53 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 51 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -