# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225122 | Vimmer | Mobitel (COCI19_mobitel) | C++14 | 13 ms | 2944 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.
#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(1e9 + 7)
using namespace std;
typedef long long ll;
typedef long double ld;
ll a[305][305], dp[305][305], f[305][305], n, m, s, ans;
int mk[305][305];
vector <pair <ll, ll> > vr;
void rec(int x, int y, ll sm, ll kol);
void dfs(int x, int y)
{
if (mk[x][y] == sz(vr)) return;
mk[x][y] = sz(vr);
if (x + 1 != n)
{
if (a[x + 1][y] == 1) dfs(x + 1, y);
else rec(x + 1, y, vr.back().F * a[x + 1][y], (vr.back().S * f[x][y]) % MOD);
}
if (y + 1 != m)
{
if (a[x][y + 1] == 1) dfs(x, y + 1);
else rec(x, y + 1, vr.back().F * a[x][y + 1], (vr.back().S * f[x][y]) % MOD);
}
}
void rec(int x, int y, ll sm, ll kol)
{
if (sm >= s) {ans = (ans + (kol * dp[x][y]) % MOD) % MOD; return;}
if (a[x][y] == 1) {vr.pb({sm, kol}); dfs(x, y); return;}
if (x + 1 != n) rec(x + 1, y, sm * a[x + 1][y], kol);
if (y + 1 != m) rec(x, y + 1, sm * a[x][y + 1], kol);
}
int main()
{
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m >> s;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> a[i][j];
dp[n - 1][m - 1] = 1;
for (int i = n - 1; i >= 0; i--)
for (int j = m - 1; j >= 0; j--)
{
if (i + 1 != n) dp[i][j] = (dp[i][j] + dp[i + 1][j]) % MOD;
if (j + 1 != m) dp[i][j] = (dp[i][j] + dp[i][j + 1]) % MOD;
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
if (a[i][j] != 1) continue;
bool fr = 0;
if (i != 0 && a[i - 1][j] == 1) {fr = 1; f[i][j] = (f[i - 1][j] + f[i][j]) % MOD;}
if (j != 0 && a[i][j - 1] == 1) {fr = 1; f[i][j] = (f[i][j - 1] + f[i][j]) % MOD;}
if (!fr) f[i][j] = 1;
}
rec(0, 0, a[0][0], 1);
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |