Submission #1075614
Source Code Expand
#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;
template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
const int P = 1e9 + 7;
const int N = 4e3 + 5;
int dp[N][N];
int32_t main() {
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
cin.tie(0);
//double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
int n, m, k;
cin>>n>>m>>k;
int l = (n + m - 1) / (k - 1);
dp[0][0] = 1;
RE (d, l) {
REP (here, k) {
FOR (prev_sum, 0, m) {
int new_sum = prev_sum + here;
dp[d][new_sum] = (dp[d][new_sum] + dp[d - 1][prev_sum]) % P;
}
}
}
int res = 0;
for (int S = m; S > 0; S -= k - 1) {
int lacks = (m - S) / (k - 1);
res += dp[l - lacks][S];
res %= P;
}
cout<<res<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Eternal Average |
User |
Swistakk |
Language |
C++14 (GCC 5.4.1) |
Score |
1600 |
Code Size |
3256 Byte |
Status |
AC |
Exec Time |
174 ms |
Memory |
78720 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 |
174 ms |
78720 KB |
03.txt |
AC |
3 ms |
256 KB |
04.txt |
AC |
3 ms |
256 KB |
05.txt |
AC |
98 ms |
39552 KB |
06.txt |
AC |
38 ms |
13312 KB |
07.txt |
AC |
7 ms |
2304 KB |
08.txt |
AC |
5 ms |
1024 KB |
09.txt |
AC |
24 ms |
2816 KB |
10.txt |
AC |
22 ms |
2176 KB |
11.txt |
AC |
18 ms |
384 KB |
12.txt |
AC |
18 ms |
384 KB |
13.txt |
AC |
19 ms |
1024 KB |
14.txt |
AC |
10 ms |
384 KB |
15.txt |
AC |
18 ms |
1024 KB |
16.txt |
AC |
5 ms |
256 KB |
17.txt |
AC |
13 ms |
384 KB |
18.txt |
AC |
16 ms |
1792 KB |
19.txt |
AC |
23 ms |
10368 KB |
20.txt |
AC |
36 ms |
10368 KB |
21.txt |
AC |
3 ms |
256 KB |
22.txt |
AC |
39 ms |
10112 KB |
23.txt |
AC |
18 ms |
1664 KB |
24.txt |
AC |
16 ms |
1280 KB |
s1.txt |
AC |
3 ms |
256 KB |
s2.txt |
AC |
3 ms |
256 KB |
s3.txt |
AC |
3 ms |
384 KB |