oj.uz

Submission #44861

# Submission time Handle Problem Language Result Execution time Memory
44861 2018-04-08T09:50:25 Z bogdan10bos Calvinball championship (CEOI15_teams) C++14
100 / 100
 449 ms 764 KB 
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

const int mod = 1e6 + 7;

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

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]);
        mxx[i] = max(mxx[i - 1], v[i]);
    }

    for(int i = 1; i <= N; i++) dp[i] = 1;

    int ans = 1;
    for(int i = N; i >= 1; i--)
    {
        (ans += (1LL * (v[i] - 1) * dp[ mxx[i - 1] ]) % mod) %= mod;
        for(int j = 1; j <= N; j++)
            dp[j] = ((1LL * dp[j] * j) % mod + dp[j + 1]) % mod;
    }

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

    return 0;
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
teams.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         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 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 411 ms 736 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 736 KB Output is correct
2 Correct 113 ms 736 KB Output is correct
3 Correct 105 ms 736 KB Output is correct

Subtask #10
10.0 / 10.0

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