#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int MOD = 1e9 + 7;
int R, S, N, ans, A[305][305], dp[2][305][5005], rev[1000005];
vector<int> vec;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> R >> S >> N;
N--;
for (int i = 1; i <= R; i++)
for (int j = 1; j <= S; j++) cin >> A[i][j];
for (int i = 1; i <= N + 1; i++) vec.pb(N / i);
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
for (int i = 0; i < vec.size(); i++) rev[vec[i]] = i;
for (int i = 1; i <= R; i++)
for (int j = 1; j <= S; j++) {
if (i == 1 && j == 1) dp[i & 1][j][rev[N / A[1][1]]]++;
else {
for (int k : vec) dp[i & 1][j][rev[k]] = 0;
for (int k : vec) {
if (i > 1) {
dp[i & 1][j][rev[k / A[i][j]]] += dp[i & 1 ^ 1][j][rev[k]];
dp[i & 1][j][rev[k / A[i][j]]] %= MOD;
}
if (j > 1) {
dp[i & 1][j][rev[k / A[i][j]]] += dp[i & 1][j - 1][rev[k]];
dp[i & 1][j][rev[k / A[i][j]]] %= MOD;
}
}
}
}
cout << (dp[R & 1][S][0] + MOD) % MOD << '\n';
}
Compilation message
mobitel.cpp:32:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
32 | main() {
| ^~~~
mobitel.cpp: In function 'int main()':
mobitel.cpp:42:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for (int i = 0; i < vec.size(); i++) rev[vec[i]] = i;
| ~~^~~~~~~~~~~~
mobitel.cpp:50:46: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
50 | dp[i & 1][j][rev[k / A[i][j]]] += dp[i & 1 ^ 1][j][rev[k]];
| ~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
64 ms |
3532 KB |
Output is correct |
| 2 |
Correct |
68 ms |
3532 KB |
Output is correct |
| 3 |
Correct |
450 ms |
11772 KB |
Output is correct |
| 4 |
Correct |
492 ms |
12792 KB |
Output is correct |
| 5 |
Correct |
482 ms |
12708 KB |
Output is correct |
| 6 |
Correct |
487 ms |
12712 KB |
Output is correct |
| 7 |
Correct |
237 ms |
10684 KB |
Output is correct |
| 8 |
Correct |
2249 ms |
17616 KB |
Output is correct |
| 9 |
Correct |
4089 ms |
20800 KB |
Output is correct |
| 10 |
Correct |
4135 ms |
21124 KB |
Output is correct |
