제출 #857884

#제출 시각아이디문제언어결과실행 시간메모리
857884Muhammad_AneeqCalvinball championship (CEOI15_teams)C++17
10 / 100
41 ms65536 KiB
#include <iostream> using namespace std; #define int long long int mod= 1e6+7; signed main() { int n; cin>>n; int a[n]; for (auto& i:a) cin>>i; int dp[n+10][n+10]={}; for (int i=1;i<=n;i++) dp[i][n]=1; for (int i=n-1;i>=1;i--) { int z=0; for (int j=1;j<=i;j++) { dp[j][i]+=dp[j][i+1]+dp[j+1][i+1]+z; dp[j][i]%=mod; z+=dp[j][i+1]; z%=mod; } } int ans=0; for (int i=1;i<=n;i++) { for (int j=1;j<a[i-1];j++) { ans+=dp[j][i]; ans%=mod; } } ans++; ans%=mod; cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...