Submission #225007

#	Time	Username	Problem	Language	Result	Execution time	Memory
225007		NONAME	Mobitel (COCI19_mobitel)	C++17	0 / 130	6081 ms	65540 KiB

mobitel

#include <bits/stdc++.h>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;

//mt19937 rnd(0);

int n, m, mx, a[300][300];
map <int, int> f[300][300];

void add(int &x, int y) {
    x += y;

    if (x >= base)
        x -= base;
}

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

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

    for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
    for (int k = 1; k <= mx; k++) {
        if (f[i][j].count(k) == 0)
            continue;

        if (i + 1 != n)
            add(f[i + 1][j][min(1ll * mx, a[i + 1][j] * 1ll * k)], f[i][j][k]);

        if (j + 1 != m)
            add(f[i][j + 1][min(1ll * mx, a[i][j + 1] * 1ll * k)], f[i][j][k]);
    }

    cout << f[n - 1][m - 1][mx];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef _LOCAL
        in("input.txt");

        int t = 1;
//        cin >> t;
        for (int i = 1; i <= t; i++) {
            cout << "Test #" << i << elf;

            clock_t start_time = clock();

            solve();

            cerr.precision(4); cerr << fixed;
            cerr << elf;
            cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;

            cout << elf;
        }
    #else
        int t = 1;
//        cin >> t;

        while (t--) {
            solve();
            cout << el;
        }
    #endif
}

• Subtask 1: 0 / 130