oj.uz

Submission #44855

# Submission time Handle Problem Language Result Execution time Memory
44855 2018-04-08T09:40:22 Z bogdan10bos Calvinball championship (CEOI15_teams) C++14
70 / 100
 214 ms 65536 KB 
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

const int mod = 1e6 + 7;

int N;
int v[10005];
int dp[3005][3005];

int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    #endif

    scanf("%d", &N);
    for(int i = 1; i <= N; i++) scanf("%d", &v[i]);

    for(int i = 1; i <= N; i++) dp[1][i] = 1;
    for(int i = 2; i <= N; i++)
        for(int j = 1; j <= N; j++)
            dp[i][j] = (dp[i - 1][j] * j + dp[i - 1][j + 1]) % mod;

    int ans = 1;
    int mx = 0;
    for(int i = 1; i <= N; i++)
    {
        (ans += (1LL * (v[i] - 1) * dp[N - i + 1][mx]) % mod) %= mod;
        mx = max(mx, v[i]);
    }

    printf("%d\n", ans);

    return 0;
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
teams.cpp:21:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= N; i++) scanf("%d", &v[i]);
                                 ~~~~~^~~~~~~~~~~~~

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 480 KB Output is correct
6 Correct 2 ms 532 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 161 ms 65536 KB Execution killed with signal 11 (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 188 ms 65536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -