Submission #1244954

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244954		CyberCow	축구 경기장 (IOI23_soccer)	C++20	0 / 100	0 ms	324 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

int biggest_stadium(int n, vector<vector<int>> f)
{
    int st = 0, ind = -1, ind1 = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if(!((i == 0 && j == 0) || (i == 0 && j == n - 1) || (i == n - 1 && j == 0) || (i == n - 1 && j == n - 1)))
            {
                //cout << i << ' ' << j << '\n';
                if(f[i][j] == 1 &&(i == 0 || j == 0 || i == n - 1 || j == n - 1))
                {
                    //cout << "blblbl";
                    st = 1;
                    ind = i;
                    ind1 = j;
                }
            }    
        }
    }
    if(ind == -1)
    return n * n;
    if(st)
    {
        if(ind == 0 || ind == n - 1)
            return n * n - min(ind1 + 1, n - ind1);
        return n * n - min(ind + 1, n - ind);
    }
    return n * n - 1;
}

• 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