oj.uz

Submission #46450

# Submission time Handle Problem Language Result Execution time Memory
46450 2018-04-20T21:16:00 Z alex99 Calvinball championship (CEOI15_teams) C++14
100 / 100
 706 ms 1348 KB 
#include <iostream>
using namespace std;
int N;
int A[10005];
int DP[10005];
int Fact[10005], Inv[10005];
const int MOD = 1000007;
int Power[10005];
int Nb[10005];
int C[2][10005];
int power(int n, int p)
{
    int sol = 1;
    while(p)
    {
        if(p % 2 == 1)
        {
            sol = (1LL * sol * n) % MOD;
        }
        p /= 2;
        n = (1LL * n * n) % MOD;
    }
    return sol;
}
void Read()
{
    cin >> N;
    for(int i = 1; i <= N; i++)
        cin >> A[i];
}
void precalcFact()
{
    Fact[0] = 1;
    for(int i = 1; i <= N; i++)
        Fact[i] = (1LL * Fact[i - 1] * i) % MOD;
    Inv[N] = power(Fact[N], MOD - 2);
    for(int i = N - 1; i >= 0; i--)
    {
        Inv[i] = (1LL * Inv[i + 1] * (i + 1)) % MOD;
    }
}

int Comb(int n, int k)
{
    return C[n][k];
}
inline void Add(int& x, int y)
{
    x += y;
    if(x >= MOD)
        x -= MOD;
}
void precalcDP()
{
    DP[0] = 1;
    for(int i = 1; i <= N; i++)
    {
        for(int j = 0; j < i; j++)
        {
            Add(DP[i], (1LL * DP[i - 1 - j] * Comb(i - 1, j)) % MOD);
        }
    }
}
void precalcComb()
{
    for(int i = 0; i <= N; i++)
        C[i][0] = 1;
    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= i; j++)
        {
            C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
            if(C[i][j] >= MOD)
                C[i][j] -= MOD;
        }
}
void Solve()
{
    int nb = 1, ans = 1;
    Nb[1] = 1;
    for(int i = 2; i <= N; i++)
    {
        if(A[i] == Nb[i - 1] + 1)
            Nb[i] = Nb[i - 1] + 1;
        else
            Nb[i] = Nb[i - 1];
    }
    int ind = 0;
    C[0][0] = 1;
    for(int i = N; i >= 2; i--, ind = 1 - ind)
    {
        /*if(A[i] == 1)
            continue;*/
        int aux = 0;
        int pw = 1;
        if(i < N)
        {
            for(int j = N - i; j >= 1; j--)
            {
                C[ind][j] = C[1 - ind][j - 1];
                Add(C[ind][j], C[1 - ind][j]);
            }
            C[ind][0] = 1;
            int x = N - i;
            for(int j = 0; j < x; j++)
            {
                Add(DP[x], (1LL * DP[x - 1 - j] * C[1 - ind][j]) % MOD);
            }
        }
        for(int j = N - i; j >= 0; j--)
        {
            Add(aux, (1LL * C[ind][j] * DP[j] * pw) % MOD);
            pw = (1LL * pw * Nb[i - 1]) % MOD;
        }
        Add(ans, (1LL * aux * (A[i] - 1)) % MOD);
    }
    cout << ans << "\n";
}
int main()
{
    Read();
    precalcFact();
    DP[0] = 1;
   // precalcComb();
    //precalcDP();
    Solve();
    //cout << DP[N] << "\n";
    return 0;
}

Compilation message

teams.cpp: In function 'void Solve()':
teams.cpp:78:9: warning: unused variable 'nb' [-Wunused-variable]
     int nb = 1, ans = 1;
         ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 448 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 532 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 540 KB Output is correct
2 Correct 3 ms 540 KB Output is correct
3 Correct 3 ms 684 KB Output is correct

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 693 ms 832 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 844 KB Output is correct
2 Correct 165 ms 844 KB Output is correct
3 Correct 165 ms 844 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 667 ms 1228 KB Output is correct
2 Correct 706 ms 1348 KB Output is correct
3 Correct 664 ms 1348 KB Output is correct