Submission #3265069
Source Code Expand
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int N=2005; typedef long long ll; const ll mod=1e9+7; int n,m,k; int d[2][N][2],sum[N]; int main() { scanf("%d%d%d",&n,&m,&k); m--; k--; for(int i=1;i<=k;i++){ d[0][i][1]=1; } d[0][0][0]=1; int ans=0; for(int i=0;i<=n;i++) if(k-i<=m&&i%k==n%k&&(k-i)%k==m%k){ ans+=d[0][i][1]; ans%=mod; } int v=1,u=0; for(int i=2;i<=max(n,m)*2;i++){ u^=1; v^=1; memset(d[u],0,sizeof d[u]); for(int j=0;j<=n;j++) sum[j+1]=((sum[j]+d[v][j][0])%mod+d[v][j][1])%mod; for(int j=0;j<=n;j++){ d[u][j][0]=(sum[j+1]-sum[j])%mod; d[u][j][0]=(d[u][j][0]%mod+mod)%mod; int l=max(j-k,0); d[u][j][1]=(sum[j]-sum[l])%mod; d[u][j][1]=(d[u][j][1]%mod+mod)%mod; } for(int j=0;j<=n;j++){ if(k*i-j<=m&&j%k==n%k&&(k*i-j)%k==m%k){ ans+=d[u][j][1]; ans%=mod; } } } ans=(ans%mod+mod)%mod; printf("%d\n",ans); }
Submission Info
Submission Time | |
---|---|
Task | E - Eternal Average |
User | lcclcc |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1192 Byte |
Status | AC |
Exec Time | 197 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d",&n,&m,&k); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1600 / 1600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 197 ms | 256 KB |
03.txt | AC | 1 ms | 128 KB |
04.txt | AC | 1 ms | 128 KB |
05.txt | AC | 157 ms | 256 KB |
06.txt | AC | 2 ms | 256 KB |
07.txt | AC | 136 ms | 256 KB |
08.txt | AC | 3 ms | 256 KB |
09.txt | AC | 134 ms | 256 KB |
10.txt | AC | 134 ms | 256 KB |
11.txt | AC | 133 ms | 256 KB |
12.txt | AC | 133 ms | 256 KB |
13.txt | AC | 116 ms | 256 KB |
14.txt | AC | 78 ms | 256 KB |
15.txt | AC | 107 ms | 256 KB |
16.txt | AC | 66 ms | 256 KB |
17.txt | AC | 123 ms | 256 KB |
18.txt | AC | 32 ms | 256 KB |
19.txt | AC | 156 ms | 256 KB |
20.txt | AC | 124 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 137 ms | 256 KB |
23.txt | AC | 106 ms | 128 KB |
24.txt | AC | 98 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |