oj.uz

Submission #156360

# Submission time Handle Problem Language Result Execution time Memory
156360 2019-10-05T10:33:15 Z Akashi Calvinball championship (CEOI15_teams) C++14
100 / 100
 288 ms 632 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1000007;

int n;
int a[10005], Max[10005];
int d[2][10005];

int main()
{
    scanf("%d", &n);
    for(int i = 1; i <= n ; ++i)
        scanf("%d", &a[i]), Max[i] = max(Max[i - 1], a[i]);

    int l = 0, cnt = 1;
    for(int i = 1; i <= n ; ++i) d[0][i] = 1;

    for(int i = n; i >= 1 ; --i){
        for(int j = 1; j <= a[i] - 1 ; ++j){
            cnt += d[l][Max[i - 1]];
            if(cnt >= MOD) cnt -= MOD;
        }

        l = 1 - l;
        for(int j = 1; j <= n ; ++j)
            d[l][j] = (1LL * d[1 - l][j] * j + d[1 - l][j + 1]) % MOD;
    }
    printf("%d", cnt);

    return 0;
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
teams.cpp:14:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]), Max[i] = max(Max[i - 1], a[i]);
         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 556 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 476 KB Output is correct
2 Correct 57 ms 504 KB Output is correct
3 Correct 74 ms 476 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 604 KB Output is correct
2 Correct 220 ms 632 KB Output is correct
3 Correct 288 ms 568 KB Output is correct