Submission #928115

#	Time	Username	Problem	Language	Result	Execution time	Memory
928115		aykhn	축구 경기장 (IOI23_soccer)	C++17	0 / 100	4562 ms	2908 KiB

soccer

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

using namespace std;

int biggest_stadium(int n, vector<vector<int>> A)
{
    int res = 0;
    for (int x = 0; x < n; x++)
    {
        for (int y = 0; y < n; y++)
        {
            if (A[x][y]) continue;
            int l1, r1, l2, r2;
            for (int k = y; k >= 0; k--)
            {
                if (A[x][k]) break;
                l1 = l2 = k;
            }
            for (int k = y; k < n; k++)
            {
                if (A[x][k]) break;
                r1 = r2 = k;
            }
            int c = 0;
            for (int i = x; i >= 0; i--)
            {
                if (A[i][y]) break;
                for (int j = y; j >= l1; j--)
                {
                    if (A[i][j]) 
                    {
                        l1 = j + 1;
                        break;
                    }
                    c++;
                }
                for (int j = y + 1; j <= r1; j++)
                {
                    if (A[i][j])
                    {
                        r1 = j - 1;
                        break;
                    }
                    c++;
                }
            }
            for (int i = x + 1; i < n; i++)
            {
                if (A[i][y]) break;
                for (int j = y; j >= l2; j--)
                {
                    if (A[i][j]) 
                    {
                        l2 = j + 1;
                        break;
                    }
                    c++;
                }
                for (int j = y + 1; j <= r2; j++)
                {
                    if (A[i][j])
                    {
                        r2 = j - 1;
                        break;
                    }
                    c++;
                }
            }
            res = max(res, c);
        }
    }
    return res;
}

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