Submission #1629007
Source Code Expand
#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
if(Bufferhead==Buffertail){
int l=fread(buffer,1,BufferSize,stdin);
if(!l){Terminal=1;return 0;}
Buffertail=(Bufferhead=buffer)+l;
}
return *Bufferhead++;
}
template<class T>inline bool read(T &x){
x=0;char c=Getchar(),rev=0;
while(c<'0'||c>'9'){c=Getchar();rev|=c=='-';if(Terminal)return 0;}
while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
if(c=='.'){
c=Getchar();double t=0.1;
while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
}
x=rev?-x:x;
return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
char c=Getchar();
while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
while(c>=33&&c<=126) (*x++)=c,c=Getchar();
*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
if(!x){putchar('0');putchar(c);return;}
if(x<0) putchar('-'),x=-x;
int m=0,a[20];
while(x) a[m++]=x%10,x/=10;
while(m--) putchar(a[m]+'0');
putchar(c);
}
//--------------------------------------------------head--------------------------------------------------
const int inf=0x3f3f3f3f;
const int N=4005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
int ans=1;
while(y){
if(y&1) ans=(ll)ans*x%mod;
x=(ll)x*x%mod;y>>=1;
}return ans;
}
int n,m,k,dp[2][N<<1],ans;
int main(){
#ifdef rqgao2014
freopen("input.txt","r",stdin);
#endif
read(n,m,k);
int d=(n+m-1)/(k-1);
debug(d);
dp[0][0]=1;
for(int i=1;i<=d;i++){
for(int j=0;j<=n;j++) dp[i&1][j]=0;
for(int j=0;j<=n;j++){
int p=(n-j)%(k-1);if(!p) p+=k-1;
if(!p||j+p>n||i*(k-1)-j-p+1>m) continue;
ch(ans,dp[i-1&1][j]);
for(int p=0;p<k;p++)
ch(dp[i&1][j+p],dp[i-1&1][j]);
}
}
print(ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Eternal Average |
User |
rqgao2014 |
Language |
C++14 (GCC 5.4.1) |
Score |
1600 |
Code Size |
3125 Byte |
Status |
AC |
Exec Time |
71 ms |
Memory |
256 KB |
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 |
71 ms |
256 KB |
03.txt |
AC |
1 ms |
256 KB |
04.txt |
AC |
1 ms |
256 KB |
05.txt |
AC |
40 ms |
256 KB |
06.txt |
AC |
1 ms |
256 KB |
07.txt |
AC |
11 ms |
256 KB |
08.txt |
AC |
1 ms |
256 KB |
09.txt |
AC |
16 ms |
256 KB |
10.txt |
AC |
16 ms |
256 KB |
11.txt |
AC |
16 ms |
256 KB |
12.txt |
AC |
17 ms |
256 KB |
13.txt |
AC |
12 ms |
256 KB |
14.txt |
AC |
8 ms |
256 KB |
15.txt |
AC |
11 ms |
256 KB |
16.txt |
AC |
7 ms |
256 KB |
17.txt |
AC |
12 ms |
256 KB |
18.txt |
AC |
3 ms |
256 KB |
19.txt |
AC |
32 ms |
256 KB |
20.txt |
AC |
18 ms |
256 KB |
21.txt |
AC |
1 ms |
256 KB |
22.txt |
AC |
20 ms |
256 KB |
23.txt |
AC |
12 ms |
256 KB |
24.txt |
AC |
11 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |
s3.txt |
AC |
1 ms |
256 KB |