oj.uz

답안 #225114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225114 2020-04-19T09:33:13 Z Vimmer Mobitel (COCI19_mobitel) C++14
0 / 130
 18 ms 2944 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 <int, ll> >  vr;

void rec(int x, int y, ll sm, ll kol);

void dfs(int x, int y)
{
    if (mk[x][y] == sz(vr)) return;

    mk[x][y] = sz(vr);

    if (x + 1 != n)
    {
        if (a[x + 1][y] == 1) dfs(x + 1, y);
          else rec(x + 1, y, vr.back().F, (vr.back().S * f[x][y]) % MOD);
    }

    if (y + 1 != m)
    {
        if (a[x][y + 1] == 1) dfs(x, y + 1);
          else rec(x, y + 1, vr.back().F, (vr.back().S * f[x][y]) % MOD);
    }
}

void rec(int x, int y, ll sm, ll kol)
{
    sm *= a[x][y];

    if (sm >= s) {ans = (ans + (kol * dp[x][y]) % MOD) % MOD; return;}

    if (a[x][y] == 1) {vr.pb({sm, kol}); dfs(x, y); return;}

    if (x + 1 != n) rec(x + 1, y, sm, kol);

    if (y + 1 != m) rec(x, y + 1, sm, 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 + 1][j];

            if (j + 1 != m) dp[i][j] += dp[i][j + 1];

            dp[i][j] %= MOD;
        }

    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) && (j == 0 || a[i][j - 1] != 1)) f[i][j] = 1;

            else
            {
                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;
            }
        }

    rec(0, 0, 1, 1);

    cout << ans << endl;
}

Subtask #1
0 / 130.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 2816 KB Output isn't correct
2 Incorrect 14 ms 2944 KB Output isn't correct
3 Incorrect 6 ms 1152 KB Output isn't correct
4 Incorrect 6 ms 1280 KB Output isn't correct
5 Incorrect 6 ms 1152 KB Output isn't correct
6 Incorrect 6 ms 1152 KB Output isn't correct
7 Incorrect 5 ms 896 KB Output isn't correct
8 Incorrect 18 ms 2304 KB Output isn't correct
9 Incorrect 13 ms 2944 KB Output isn't correct
10 Incorrect 15 ms 2816 KB Output isn't correct