oj.uz

답안 #225152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225152 2020-04-19T10:20:20 Z NONAME Mobitel (COCI19_mobitel) C++17
130 / 130
 2270 ms 14476 KB 
#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);

ll lst, a[301][301];
int tops[N * 10], mx;
ll tovl[2010], n, m, k, f[2][301][2010], ans;

void add(ll &x, ll y) {
    x += y;
    if (x >= base)
        x -= base;
}

void solve() {
    cin >> n >> m >> k;

    lst = k + 1;
    for (ll i = 1; i <= k; i++) {
        ll cur = lst;
        while (cur * i >= k)
            cur--;
        cur++;

        if (cur != lst)
            mx++;

        tovl[mx] = i;
        tops[i] = mx;

        lst = cur;
    }

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

    f[0][0][tops[1]] = 1;

    for (int i = 0; i < n; i++) {
        int x = i & 1;
        for (int y = 0; y < m; y++)
        for (int z = 1; z <= mx; z++) {
            ll nw = min(k, tovl[z] * a[i][y]);
            if (nw == k && i == n - 1 && y == m - 1 && f[x][y][z])
                add(ans, f[x][y][z]);
            if (y + 1 < m) add(f[x][y + 1][tops[nw]], f[x][y][z]);
            if (i + 1 < n) add(f[x ^ 1][y][tops[nw]], f[x][y][z]);
            f[x][y][z] = 0;
        }
    }

    cout << ans;
}

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
130.0 / 130.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 3584 KB Output is correct
2 Correct 44 ms 3584 KB Output is correct
3 Correct 230 ms 7288 KB Output is correct
4 Correct 238 ms 7708 KB Output is correct
5 Correct 263 ms 7800 KB Output is correct
6 Correct 253 ms 7680 KB Output is correct
7 Correct 121 ms 6392 KB Output is correct
8 Correct 1199 ms 11768 KB Output is correct
9 Correct 2235 ms 14360 KB Output is correct
10 Correct 2270 ms 14476 KB Output is correct