# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
93734 | 2019-01-10T23:38:22 Z | abood101 | Calvinball championship (CEOI15_teams) | C++14 | 1000 ms | 504 KB |
#include <bits/stdc++.h> using namespace std; typedef pair<int,int > pp; typedef long long ll; int const N=1e4+2,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]; int main(){ scanf("%d",&n); for(int i=0;i<n;i++)scanf("%d",&aa[i]); int f=0; for(int i=1;i<=n;i++)dp[f][i][0]=dp[f][i][1]=1; for(int i=n-2;i>-1;i--){ f=1-f; for(int j=1;j<=i+1;j++){ dp[f][j][1]=(dp[!f][j][1]*1LL*j+dp[!f][j+1][1])%mod; if(aa[i+1]>j)dp[f][j][0]=(dp[!f][j][1]*1LL*j+(aa[i+1]==j+1)*dp[!f][aa[i+1]][0])%mod; else dp[f][j][0]=(dp[!f][j][1]*1LL*(aa[i+1]-1)+dp[!f][j][0])%mod; } } printf("%d\n",dp[f][1][0]); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 252 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Correct | 4 ms | 376 KB | Output is correct |
3 | Correct | 4 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 376 KB | Output is correct |
2 | Correct | 12 ms | 296 KB | Output is correct |
3 | Correct | 13 ms | 504 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1072 ms | 504 KB | Time limit exceeded |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 267 ms | 460 KB | Output is correct |
2 | Correct | 272 ms | 380 KB | Output is correct |
3 | Correct | 274 ms | 504 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1049 ms | 504 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |