# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314103 | BeanZ | Mobitel (COCI19_mobitel) | C++14 | 1534 ms | 9856 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// I_Love_LPL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 305;
const int mod = 1e9 + 7;
ll dp[2][N][2][1005];
void add(ll &x, ll y){
x += y;
if (x >= mod) x -= mod;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("A.inp", "r")){
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
ll r, s, n;
cin >> r >> s >> n;
ll c = sqrt(n);
dp[0][1][0][1] = 1;
for (int i = 1; i <= r; i++){
for (int j = 1; j <= s; j++){
ll x;
cin >> x;
// add to small
for (int k = 1; k <= c; k++){
ll p = k * x;
if (p <= c){
add(dp[i & 1][j][0][p], dp[(i + 1) & 1][j][0][k]);
add(dp[i & 1][j][0][p], dp[i & 1][j - 1][0][k]);
} else {
add(dp[i & 1][j][1][(n - 1) / p + 1], dp[(i + 1) & 1][j][0][k]);
add(dp[i & 1][j][1][(n - 1) / p + 1], dp[i & 1][j - 1][0][k]);
}
}
// add to big
for (int k = 1; k <= c; k++){
add(dp[i & 1][j][1][(k - 1) / x + 1], dp[(i + 1) & 1][j][1][k]);
add(dp[i & 1][j][1][(k - 1) / x + 1], dp[i & 1][j - 1][1][k]);
}
}
for (int j = 1; j <= s; j++){
for (int k = 1; k <= c; k++){
dp[(i + 1) & 1][j][0][k] = 0;
dp[(i + 1) & 1][j][1][k] = 0;
}
}
//if (i == 1) cout << dp[1][1][0][4] << endl;
}
cout << dp[r & 1][s][1][1];
}
/*
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |