Submission #842128

#	Time	Username	Problem	Language	Result	Execution time	Memory
842128		Tenis0206	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	238 ms	47388 KiB

soccer

#include <bits/stdc++.h>
#include "soccer.h"

using namespace std;

const int nmax = 2e3;

int n;

int a[nmax + 5][nmax + 5];

int st[nmax + 5], dr[nmax + 5];

bool verif()
{
    for(int i=1; i<=n; i++)
    {
        st[i] = dr[i] = 0;
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            if(a[i][j]==0 && a[i][j - 1]==1)
            {
                if(st[i])
                {
                    return false;
                }
                st[i] = j;
            }
            if(a[i][j]==0)
            {
                dr[i] = j;
            }
        }
    }
    bool desc = false, start = false;
    for(int i=1; i<=n; i++)
    {
        if(st[i] && !st[i - 1] && start)
        {
            return false;
        }

        if(st[i])
        {
            start = true;

            if(st[i - 1] && st[i] < st[i - 1] && desc)
            {
                return false;
            }
            if(st[i - 1] && st[i] > st[i - 1])
            {
                desc = true;
            }

            if(dr[i - 1] && dr[i] > dr[i - 1] && desc)
            {
                return false;
            }
            if(dr[i - 1] && dr[i] < dr[i - 1])
            {
                desc = true;
            }
        }
    }
    return true;
}

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    n = N;
    int nre = 0;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            a[i][j] = F[i - 1][j - 1];
            nre += (1 - a[i][j]);
        }
    }
    for(int i=0; i<=n; i++)
    {
        a[i][0] = a[0][i] = a[i][n + 1] = a[n + 1][i] = 1;
    }
    bool ok = verif();
    if(ok)
    {
        return nre;
    }
    return 0;
}

• Subtask 0: 0 / 0
• Subtask 1: 1.5 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30