Submission #43829

#	Time	Username	Problem	Language	Result	Execution time	Memory
43829		PowerOfNinjaGo	Calvinball championship (CEOI15_teams)	C++14	0 / 100	1 ms	516 KiB

teams

//Power Of Ninja Go
#include <bits/stdc++.h>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll; typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vii vector< ii >
#define pb push_back
const int md = 1e6+7;
void add(int &a, int b)
{
    a += b;
    if(a>= md) a -= md;
}
int mul(int a, int b)
{
    return (1LL*a*b)%md;
}
const int maxn = 1e4+5;
int arr[maxn];
int dp[maxn][maxn];
int main()
{
    //#ifndef atom freopen(".in", "r", stdin); freopen(".out", "w", stdout); #endif
    int n; scanf("%d", &n);
    for(int i = 1; i<= n; i++) scanf("%d", &arr[i]);

    for(int i = 1; i<= n; i++) dp[n+1][i] = 1;
    for(int i = n; i>= 1; i--)
    {
        for(int j = 0; j<= i; j++)
        {
            dp[i][j] = dp[i+1][j+1];
            add(dp[i][j], mul(j, dp[i+1][j]));
            //printf("dp[%d][%d] = %d\n", i, j, dp[i][j]);
        }
    }
    int ans = 0;
    int k = 0;
    for(int i = 1; i<= n; i++)
    {
        int np = i+1;
        if(k< arr[i])
        {
            add(ans, mul(k, dp[np][k]));
            for(int j = k+1; j< arr[i]; j++) add(ans, dp[np][j]);
        }
        else
        {
            add(ans, mul(arr[i]-1, dp[np][k]));
        }
        k = max(k, arr[i]);
    }
    printf("%d\n", ans+1);
}

Compilation message (stderr)

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

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10