oj.uz

Submission #222250

# Submission time Handle Problem Language Result Execution time Memory
222250 2020-04-12T14:19:49 Z DodgeBallMan Calvinball championship (CEOI15_teams) C++14
10 / 100
 368 ms 548 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e4 + 10;

int n, a[N];
long long dp[2][N], mod = 1e6 + 7, ans;
int main()
{
    scanf("%d",&n);
    for( int i = 1 ; i <= n ; i++ ) scanf("%d",&a[i]);
    for( int i = 1 ; i <= n ; i++ ) dp[n%2][i] = 1;
    for( int i = n-1 ; i >= 1 ; i-- ) {
        dp[i%2][0] = dp[(i+1)%2][1];
        for( int j = 1 ; j <= i ; j++ ) dp[i%2][j] = ( dp[(i+1)%2][j+1] + dp[i%2][j-1] ) % mod;
        //printf("%d %lld\n",a[i+1]-1,dp[i%2][a[i+1]-2]);
        if( a[i+1] == 1 ) continue ;
        ans = ( ans + dp[i%2][a[i+1]-2] ) % mod;
    }
    printf("%lld",( ans+1 ) % mod);
    return 0;
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
teams.cpp:12:42: 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",&a[i]);
                                     ~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 359 ms 548 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 96 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 368 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -