제출 #842166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
842166		Tenis0206	축구 경기장 (IOI23_soccer)	C++17	29.50 / 100	263 ms	47696 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];

int Minst[nmax + 5], Maxdr[nmax + 5];

bool verif()
{
    for(int i=0; i<=n; i++)
    {
        st[i] = n + 1;
        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]!=n+1)
                {
                    return false;
                }
                st[i] = j;
            }
            if(a[i][j]==0)
            {
                dr[i] = j;
            }
        }
    }
    Minst[0] = n + 1;
    for(int i=1;i<=n;i++)
    {
        Minst[i] = min(Minst[i - 1], st[i]);
        Maxdr[i] = max(Maxdr[i - 1], dr[i]);
    }
    bool desc = false, start = false;
    stack<int> stl, str;
    for(int i=1; i<=n; i++)
    {
        if(st[i]!=n+1 && st[i - 1]==n+1 && start)
        {
            return false;
        }

        if(st[i]!=n+1)
        {
            start = true;

            if(st[i - 1]!=n+1 && st[i] < st[i - 1] && desc)
            {
                return false;
            }
            if(st[i - 1]!=n+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;
            }

            int u_st = 0, u_dr = 0;

            while(!stl.empty() && st[i] >= st[stl.top()])
            {
                stl.pop();
            }
            if(stl.empty())
            {
                u_st = 0;
            }
            else
            {
                u_st = stl.top();
            }
            stl.push(i);

            while(!str.empty() && dr[i] <= dr[str.top()])
            {
                str.pop();
            }
            if(str.empty())
            {
                u_dr = 0;
            }
            else
            {
                u_dr = str.top();
            }
            str.push(i);

            if(Minst[u_dr] < st[i])
            {
                return false;
            }
            if(Maxdr[u_st] > dr[i])
            {
                return false;
            }
        }
    }
    return true;
}

int solve1()
{
    int x = 0, y = 0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(a[i][j])
            {
                x = i, y = j;
            }
        }
    }
    int Max = 0;
    Max = max(Max, n * n - x * y);
    Max = max(Max, n * n - x * (n - y + 1));
    Max = max(Max, n * n - (n - x + 1) * y);
    Max = max(Max, n * n - (n - x + 1) * (n - y + 1));
    return Max;
}

int solve2()
{
    return 0;
}

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;
    }
    if(nre==n*n-1)
    {
        return solve1();
    }
    else if(n<=3)
    {
        return solve2();
    }
    return 0;
}

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