제출 #221945

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
221945		MKopchev	Calvinball championship (CEOI15_teams)	C++14	100 / 100	281 ms	776 KiB

teams

#include<bits/stdc++.h>
using namespace std;

const int nmax=1e4+42,mod=1e6+7;

int n,inp[nmax];

bool in[nmax];

pair<int/*coeff*/,int/*k*/> noted[nmax];

int dp[nmax];

long long help[nmax];

int main()
{
    scanf("%i",&n);

    for(int i=1;i<=n;i++)
        scanf("%i",&inp[i]);

    int diff=0;
    for(int i=1;i<=n;i++)
    {
        noted[i+1]={inp[i]-1,diff};

        if(in[inp[i]]==0)diff++;
        in[inp[i]]=1;
    }

    //for(int i=1;i<=n+1;i++)cout<<i<<" -> "<<noted[i].first<<" "<<noted[i].second<<endl;

    for(int i=2;i<=n+1;i++)
    {
        dp[noted[i].second]=(dp[noted[i].second]+noted[i].first)%mod;

        if(i==n+1)
        {
            int output=1;
            for(int k=1;k<=n;k++)
                output=(output+dp[k])%mod;
            printf("%i\n",output);
            return 0;
        }

        for(int k=1;k<=i;k++)help[k]=0;

        for(int k=1;k<=i;k++)
        {
            help[k]=(help[k]+1LL*k*dp[k])%mod;
            help[k+1]=(help[k+1]+dp[k])%mod;
        }

        for(int k=1;k<=i;k++)dp[k]=help[k];

        //cout<<"i= "<<i<<" -> ";for(int k=1;k<=i;k++)cout<<dp[k]<<" ";cout<<endl;
    }
    return 0;
}

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

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

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