# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316202 | 2020-10-25T17:01:38 Z | fcmalkcin | Mobitel (COCI19_mobitel) | C++17 | 1554 ms | 9828 KB |
// 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)+2; 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; } } } cout << dp[r & 1][s][1][1]; } /* */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 5368 KB | Output is correct |
2 | Correct | 41 ms | 5248 KB | Output is correct |
3 | Correct | 123 ms | 3576 KB | Output is correct |
4 | Correct | 124 ms | 3576 KB | Output is correct |
5 | Correct | 141 ms | 3456 KB | Output is correct |
6 | Correct | 150 ms | 3540 KB | Output is correct |
7 | Correct | 62 ms | 2560 KB | Output is correct |
8 | Correct | 814 ms | 7416 KB | Output is correct |
9 | Correct | 1542 ms | 9744 KB | Output is correct |
10 | Correct | 1554 ms | 9828 KB | Output is correct |