Submission #225208

#	Time	Username	Problem	Language	Result	Execution time	Memory
225208		Vimmer	Mobitel (COCI19_mobitel)	C++14	0 / 130	6095 ms	65540 KiB

mobitel

#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 200005
#define MOD ll(998244353)

using namespace std;

typedef long long ll;


int dp[301][301][301], a[301][301];

int main()
{

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m, k;

    cin >> n >> m >> k;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) cin >> a[i][j];

   dp[0][0][min(k, a[0][0])] = 1;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
          for (int u = 0; u <= k; u++)
            {
                if (dp[i][j][u] == 0) continue;

                if (i + 1 != n) dp[i + 1][j][min(k, u * a[i + 1][j])] = (dp[i + 1][j][min(k, u * a[i + 1][j])] + dp[i][j][u]) % MOD;

                if (j + 1 != m) dp[i][j + 1][min(k, u * a[i][j + 1])] = (dp[i][j + 1][min(k, u * a[i][j + 1])] + dp[i][j][u]) % MOD;
            }
    cout << dp[n - 1][m - 1][k];
}

• Subtask 1: 0 / 130