# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
225168 |
2020-04-19T10:45:43 Z |
Vimmer |
Mobitel (COCI19_mobitel) |
C++14 |
|
6000 ms |
5560 KB |
#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);
ll calc(int x, int y, int xr, int yr)
{
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) f[i][j] = 0;
f[xr][yr] = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
if (a[i][j] != 1) continue;
if (i != 0 && a[i - 1][j] == 1) f[i][j] = (f[i - 1][j] + f[i][j]) % MOD;
if (j != 0 && a[i][j - 1] == 1) f[i][j] = (f[i][j - 1] + f[i][j]) % MOD;
}
return f[x][y];
}
void dfs(int x, int y, int xr, int yr, int id)
{
if (mk[x][y] == id) return;
mk[x][y] = id;
if (x + 1 != n)
{
if (a[x + 1][y] == 1) dfs(x + 1, y, xr, yr, id);
else rec(x + 1, y, vr[id - 1].F * a[x + 1][y], (vr[id - 1].S * calc(x, y, xr, yr)) % MOD);
}
if (y + 1 != m)
{
if (a[x][y + 1] == 1) dfs(x, y + 1, xr, yr, id);
else rec(x, y + 1, vr[id - 1].F * a[x][y + 1], (vr[id - 1].S * calc(x, y, xr, yr)) % 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, x, y, sz(vr)); 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;
}
rec(0, 0, a[0][0], 1);
cout << ans << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
6050 ms |
3100 KB |
Time limit exceeded |
2 |
Execution timed out |
6089 ms |
3064 KB |
Time limit exceeded |
3 |
Execution timed out |
6055 ms |
5560 KB |
Time limit exceeded |
4 |
Execution timed out |
6086 ms |
3608 KB |
Time limit exceeded |
5 |
Execution timed out |
6051 ms |
1592 KB |
Time limit exceeded |
6 |
Execution timed out |
6064 ms |
3576 KB |
Time limit exceeded |
7 |
Execution timed out |
6052 ms |
2336 KB |
Time limit exceeded |
8 |
Execution timed out |
6082 ms |
2744 KB |
Time limit exceeded |
9 |
Execution timed out |
6022 ms |
2816 KB |
Time limit exceeded |
10 |
Execution timed out |
6039 ms |
3540 KB |
Time limit exceeded |