oj.uz

Submission #593405

# Submission time Handle Problem Language Result Execution time Memory
593405 2022-07-11T05:13:23 Z Hanksburger Calvinball championship (CEOI15_teams) C++17
100 / 100
 109 ms 468 KB 
#include <bits/stdc++.h>
using namespace std;
const int mod=1e6+7;
int a[10005], m[10005], d[2][10005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, ans=1;
    cin >> n;
    bool b=n&1;
    for (int i=1; i<=n; i++)
    {
        cin >> a[i];
        m[i]=max(m[i-1], a[i]);
        d[b][i]=1;
    }
    for (int i=n-1; i; i--, b^=1)
    {
        ans=(ans+d[b][m[i]]*(a[i+1]-1LL))%mod;
        for (int j=1; j<=i; j++)
            d[!b][j]=((long long)d[b][j]*j+d[b][j+1])%mod;
    }
    cout << ans;
    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 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 1 ms 212 KB Output is correct
6 Correct 0 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 0 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 0 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 340 KB Output is correct
2 Correct 33 ms 396 KB Output is correct
3 Correct 25 ms 340 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 456 KB Output is correct
2 Correct 96 ms 468 KB Output is correct
3 Correct 109 ms 468 KB Output is correct