Submission #456443

#	Time	Username	Problem	Language	Result	Execution time	Memory
456443		Tenis0206	Game (eJOI20_game)	C++11	0 / 100	1 ms	332 KiB

game

#include <bits/stdc++.h>

using namespace std;
int n,m;
bool sus[105][105],st[105][105];
int sel[105][105];
bool loop = false;
int nr = 0;
int cnt = 0;
vector<pair<int,int>> c;
void Fill(int i, int j, int si, int sj)
{
    ++nr;
    sel[i][j] = cnt;
    if(!sus[i][j] && i-1>0)
    {
        if(sel[i-1][j])
        {
            if(sel[i-1][j]==cnt && (i-1!=si || j!=sj))
            {
                loop = true;
            }
        }
        else
        {
            Fill(i-1,j,i,j);
        }
    }
    if(!sus[i+1][j] && i+1<=n)
    {
        if(sel[i+1][j])
        {
            if(sel[i+1][j]==cnt && (i+1!=si || j!=sj))
            {
                loop = true;
            }
        }
        else
        {
            Fill(i+1,j,i,j);
        }
    }
    if(!st[i][j] && j-1>0)
    {
        if(sel[i][j-1])
        {
            if(sel[i][j-1]==cnt && (i!=si || j-1!=sj))
            {
                loop = true;
            }
        }
        else
        {
            Fill(i,j-1,i,j);
        }
    }
    if(!st[i][j+1] && j+1<=m)
    {
        if(sel[i][j+1])
        {
            if(sel[i][j+1]==cnt && (i!=si || j+1!=sj))
            {
                loop = true;
            }
            return;
        }
        else
        {
            Fill(i,j+1,i,j);
        }
    }
}
int Back(int k, bool turn)
{
    if(k==c.size())
    {
        return 0;
    }
    if(turn)
    {
        int Min = Back(k+1,0) - c[k].first;
        if(c[k].second==true && c[k].first>4)
        {
            Min = max(Min,Back(k+1,1) - c[k].first + 4);
        }
        if(c[k].second==false && c[k].first>2)
        {
            Min = min(Min,Back(k+1,1) - c[k].first + 2);
        }
        return Min;
    }
    else
    {
        int Max = Back(k+1,1) + c[k].first;
        if(c[k].second==true && c[k].first>4)
        {
            Max = max(Max,Back(k+1,0) + c[k].first - 4);
        }
        if(c[k].second==false && c[k].first>2)
        {
            Max = max(Max,Back(k+1,0) + c[k].first - 2);
        }
        return Max;
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1; i<=n+1; i++)
    {
        for(int j=1; j<=m; j++)
        {
            char ch;
            cin>>ch;
            sus[i][j] = ch-'0';
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m+1; j++)
        {
            char ch;
            cin>>ch;
            st[i][j] = ch-'0';
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(sus[i][j] && sus[i+1][j] && st[i][j] && st[i][j+1])
            {
                sel[i][j] = -1;
                continue;
            }
            if(sel[i][j])
            {
                continue;
            }
            nr = 0;
            ++cnt;
            loop = false;
            Fill(i,j,0,0);
            c.push_back({nr,loop});
        }
    }
    sort(c.begin(),c.end());
    cout<<Back(0,1)<<'\n';
    return 0;
}

Compilation message (stderr)

game.cpp: In function 'int Back(int, bool)':
game.cpp:75:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     if(k==c.size())
      |        ~^~~~~~~~~~

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