oj.uz

답안 #142921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
142921 2019-08-12T07:46:48 Z Ruxandra985 Calvinball championship (CEOI15_teams) C++14
0 / 100
 405 ms 732 KB 
#include <cstdio>
#include <iostream>
#define DIMN 10010
#define MOD 1000000007
using namespace std;
int v[DIMN];
long long d[DIMN][2] , s[2][DIMN];
int main()
{
   // FILE *fin = fopen ("a.in","r");
   // FILE *fout = fopen ("a.out","w");
    int n,maxi,i,lin,j;
    scanf ("%d",&n);
    maxi = 0;
    for (i=1;i<=n;i++){
        scanf ("%d",&v[i]);
        maxi = max ( maxi , v[i] );
    }

    /// partea 1 : secv doar cu elem intre 1 .. maxi - 1

    long long sol = 0;

    s[0][0] = 1;

    for (i=1;i<=n;i++){
        lin = (i&1);
        for (j=1;j<maxi;j++){
            s[lin][j] = (s[1-lin][j-1] + (s[1-lin][j] * j)%MOD)%MOD;
            if (i == n)
                sol = (sol + s[lin][j])%MOD;
        }
        s[0][0] = 0;
    }


    /// partea 2 : secv care CLAR au si un maxi
    d[0][0] = 1;
    for (i=1;i<=n;i++){
        if (v[i] == maxi){
            d[i][0] = (d[i-1][0] * (v[i]-1))%MOD; /// NU PUI MAXI
            d[i][1] = (d[i-1][0] + (d[i-1][1] * v[i])%MOD)%MOD;
        }
        else {
            d[i][0] = (d[i-1][0] * v[i])%MOD;
            d[i][1] = (d[i-1][1] * v[i])%MOD;
        }
    }

    printf ("%lld" , (d[n][1] + sol )%MOD);
    return 0;
}

Compilation message

teams.cpp: In function 'int main()':
teams.cpp:13:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d",&n);
     ~~~~~~^~~~~~~~~
teams.cpp:16:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%d",&v[i]);
         ~~~~~~^~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 405 ms 732 KB Output isn't correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -