Submission #839784

#	Time	Username	Problem	Language	Result	Execution time	Memory
839784		model_code	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	261 ms	35064 KiB

soccer

// incorrect/BM_wd_25%.cpp

#include "soccer.h"

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    int lastRow = 0;
    bool inc = true;
    int last1 = -1, last2 = -1, cnt = 0;
    for (int i = 0; i < N; i++)
    {
        lastRow = i;
        bool finish = false;
        int n1 = -1, n2 = -1;
        for (int j = 0; j < N; j++)
        {
            if (F[i][j] == 0)
            {
                if (finish)
                    return -1;
                if (n1 == -1)
                    n1 = j;
                n2 = j;
                cnt++;
            }
            else if (j > 0 && F[i][j - 1] == 0)
            {
                finish = true;
            }
        }
        if (n1 == -1)
        {
            if (last1 != -1)
                break;
        }
        else
        {
            if (last1 != -1)
            {
                if ((last1 < n1 && last2 < n2) || (last1 > n1 && last2 > n2))
                    return -1;
                if (!inc && (last1 > n1 || last2 < n2))
                    return -1;
                if (last1 < n1 || n2 < last2)
                    inc = false;
            }
            last1 = n1;
            last2 = n2;
        }
    }

    for (int i = lastRow + 1; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if (F[i][j] == 0)
                return -1;
        }
    }

    return cnt;
}

• 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