Submission #225010

#	Time	Username	Problem	Language	Result	Execution time	Memory
225010		VEGAnn	Mobitel (COCI19_mobitel)	C++14	26 / 130	308 ms	1408 KiB

mobitel

#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define ft first
#define sd second
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
const int N = 310;
const int md = int(1e9) + 7;
int f[2][N][N], r, c, n, a[N][N];

void SUM(int &x, int y){
    x += y;
    if (x >= md)
        x -= md;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> r >> c >> n;

    assert(n <= 300);

    for (int i = 1; i <= r; i++)
        for (int j = 1; j <= c; j++)
            cin >> a[i][j];

    f[0][1][min(a[1][1], n)] = 1;

    int it = 0;

    for (int i = 1; i <= r; i++) {
        for (int j = 1; j <= c; j++)
        for (int k = 1; k <= n; k++)
            f[it ^ 1][j][k] = 0;

        for (int j = 1; j <= c; j++)
        for (int k = 1; k <= n; k++){
            if (f[it][j][k] == 0) continue;

            if (i + 1 <= r)
                SUM(f[it ^ 1][j][min(n, k * a[i + 1][j])], f[it][j][k]);

            if (j + 1 <= c)
                SUM(f[it][j + 1][min(n, k * a[i][j + 1])], f[it][j][k]);
        }

        it ^= 1;
    }

    cout << f[it ^ 1][c][n];

    return 0;
}

• Subtask 1: 26 / 130