제출 #466069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
466069		SamAnd	Game (eJOI20_game)	C++17	20 / 100	1 ms	320 KiB

game

#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 22;

int n, m;
char t[N][N], s[N][N];

bool c[N][N];

int q;
bool p;
void dfs(int x, int y)
{
    if (!(1 <= x && x <= n && 1 <= y && y <= m))
    {
        p = true;
        return;
    }
    if (c[x][y])
        return;
    ++q;
    c[x][y] = true;

    if (t[x][y] == '0')
        dfs(x + 1, y);
    if (t[x - 1][y] == '0')
        dfs(x - 1, y);
    if (s[x][y] == '0')
        dfs(x, y + 1);
    if (s[x][y - 1] == '0')
        dfs(x, y - 1);
}

int rec(pair<vector<int>, vector<int> > v, int x, bool p)
{
    if (v.fi.empty() && v.se.empty())
        return x;
    //if (mp.find(m_p(v, x)) != mp.end())
    //    return mp[m_p(v, x)];

    int ans = -N * N;

    pair<vector<int>, vector<int> > vv;

    if (p && x >= 2)
    {
        ans = max(ans, x - 2 - 2 - rec(v, 0, false));
    }
    if (!p && x >= 4)
    {
        ans = max(ans, x - 4 - 4 - rec(v, 0, false));
    }
    if (!v.fi.empty())
    {
        vv = v;
        vv.fi.pop_back();
        ans = max(ans, x - rec(vv, v.fi.back(), false));
    }
    if (!v.se.empty())
    {
        vv = v;
        vv.se.pop_back();
        ans = max(ans, x - rec(vv, v.se.back(), true));
    }
    return ans;
}

void solv()
{
    cin >> n >> m;
    for (int i = 0; i <= n; ++i)
    {
        cin >> (t[i] + 1);
    }
    for (int i = 1; i <= n; ++i)
    {
        cin >> s[i];
    }

    vector<int> v[2];
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if (!c[i][j])
            {
                q = 0;
                p = false;
                dfs(i, j);
                if (t[i][j] == '1' && t[i - 1][j] == '1' && s[i][j] == '1' && s[i][j - 1] == '1')
                    continue;
                v[p].push_back(q);
            }
        }
    }

    /*for (int i = 0; i < n; ++i)
    {
        int x;
        cin >> x;
        v[1].push_back(x);
    }
    for (int i = 0; i < m; ++i)
    {
        int x;
        cin >> x;
        v[0].push_back(x);
    }*/

    for (int i = 0; i < 2; ++i)
    {
        sort(all(v[i]));
        reverse(all(v[i]));
    }
    cout << rec(m_p(v[0], v[1]), 0, false) << "\n";
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    ios_base::sync_with_stdio(false), cin.tie(0);

    int tt = 1;
    //cin >> tt;
    while (tt--)
    {
        solv();
    }
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20