제출 #93592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93592		abood101	Calvinball championship (CEOI15_teams)	C++17	20 / 100	1035 ms	628 KiB

teams

#include <bits/stdc++.h>
using namespace std;
 
typedef pair<int,int > pp;
typedef long long ll;
 
int const N=1e4+1,oo=1e9,M=1e6;
ll const OO=1e18;
double const eps=1e-6,PI=acos(-1);
int mod=M+7;

int n,aa[N],dp[2][N][2],dp1[2][N];

int main(){
    scanf("%d",&n);
    int mx=0;
    for(int i=0;i<n;i++){
        scanf("%d",&aa[i]);
        mx=max(mx,aa[i]);
    }
    int f=0,an=0;
    dp1[f][1]=1;
    dp[f][1][0]=1;
    for(int i=1,un=1;i<n;i++){
        f=1-f;
        un=max(un,aa[i]);
        dp[f][un][0]=1;
        for(int j=1;j<=i+1&&j<mx;j++){
            dp1[f][j]=(dp1[!f][j]*1LL*j+dp1[!f][j-1])%mod;
            dp[f][j][1]=(dp[!f][j][1]*1LL*j+dp[!f][j][0]*1LL*min(j,aa[i]-1)+dp[!f][j-1][1])%mod;
        }
        dp[f][mx][1]=(dp[!f][mx][1]*1LL*mx+dp[!f][mx][0]*1LL*min(mx,aa[i]-1)+dp[!f][mx-1][1])%mod;
    }
    for(int i=1;i<mx;i++){
        an+=dp1[f][i];
        if(an>mod)an-=mod;
    }
    an+=dp[f][mx][1]+1;
    if(an>mod)an-=mod;
    printf("%d\n",an);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 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