Submission #1078023
Source Code Expand
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
#include<cassert>
using namespace std;
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#define buli(x) (__builtin_popcountll(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fil(a,b) memset((a),(b),sizeof(a))
#define cl(a) fil(a,0)
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define rep(i,a,b) for (int i=(a),_ed=(b);i<_ed;i++)
#define per(i,a,b) for (int i=(b)-1,_ed=(a);i>=_ed;i--)
#define forg(i,gu) for (int i=gu;~i;i=e[i].next)
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
void getre(){int x=0;printf("%d\n",1/x);}
void gettle(){int res=1;while(1)res<<=1;printf("%d\n",res);}
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename N,typename PN>inline N flo(N a,PN b){return a>=0?a/b:-((-a-1)/b)-1;}
template<typename N,typename PN>inline N cei(N a,PN b){return a>0?(a-1)/b+1:-(-a/b);}
template<typename N>N gcd(N a,N b){return b?gcd(b,a%b):a;}
template<typename N>inline int sgn(N a){return a>0?1:(a<0?-1:0);}
#if ( ( _WIN32 || __WIN32__ ) && __cplusplus < 201103L)
#define lld "%I64d"
#else
#define lld "%lld"
#endif
inline void gn(long long&x){
int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
#ifdef JCVB
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif
typedef long long ll;
typedef double db;
inline ll sqr(ll a){return a*a;}
inline db sqrf(db a){return a*a;}
const int inf=0x3f3f3f3f;
//const ll inf=0x3f3f3f3f3f3f3f3fll;
const db pi=3.14159265358979323846264338327950288L;
const db eps=1e-6;
const int mo=1e9+7;
int qp(int a,ll b){int n=1;do{if(b&1)n=1ll*n*a%mo;a=1ll*a*a%mo;}while(b>>=1);return n;}
int f[4222][4222];
int n,m,k;
int res=0;
int main()
{
#ifdef JCVB
//freopen("1.in","r",stdin);
//freopen("1.out","w",stdout);
int _time_jc=clock();
#endif
gn(n);gn(m);gn(k);
f[0][0]=1;
int d=(n+m-1)/(k-1);
d++;
rep(i,0,d)rep(j,0,m+1)if(f[i][j]){
rep(t,0,k)upmo(f[i+1][j+t],f[i][j]);
rep(t,1,k){
int tot=i*(k-1)+k;
int tot1=j+t;
int tot0=tot-tot1;
if(tot1<=m && tot0<=n && (n-tot0)%(k-1)==0)upmo(res,f[i][j]);
}
}
printf("%d\n",res);
#ifdef JCVB
debug("time: %d\n",int(clock()-_time_jc));
#endif
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Eternal Average |
User |
jcvb |
Language |
C++14 (GCC 5.4.1) |
Score |
1600 |
Code Size |
3523 Byte |
Status |
AC |
Exec Time |
137 ms |
Memory |
39680 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 |
3 ms |
256 KB |
02.txt |
AC |
137 ms |
39680 KB |
03.txt |
AC |
3 ms |
256 KB |
04.txt |
AC |
2 ms |
256 KB |
05.txt |
AC |
84 ms |
20096 KB |
06.txt |
AC |
23 ms |
5504 KB |
07.txt |
AC |
6 ms |
2304 KB |
08.txt |
AC |
5 ms |
640 KB |
09.txt |
AC |
41 ms |
1536 KB |
10.txt |
AC |
41 ms |
1152 KB |
11.txt |
AC |
30 ms |
256 KB |
12.txt |
AC |
28 ms |
256 KB |
13.txt |
AC |
34 ms |
640 KB |
14.txt |
AC |
18 ms |
384 KB |
15.txt |
AC |
32 ms |
640 KB |
16.txt |
AC |
6 ms |
256 KB |
17.txt |
AC |
24 ms |
256 KB |
18.txt |
AC |
17 ms |
896 KB |
19.txt |
AC |
22 ms |
9472 KB |
20.txt |
AC |
39 ms |
5632 KB |
21.txt |
AC |
3 ms |
256 KB |
22.txt |
AC |
45 ms |
5120 KB |
23.txt |
AC |
32 ms |
896 KB |
24.txt |
AC |
30 ms |
768 KB |
s1.txt |
AC |
3 ms |
256 KB |
s2.txt |
AC |
2 ms |
256 KB |
s3.txt |
AC |
3 ms |
384 KB |