Submission #1163860

#	Time	Username	Problem	Language	Result	Execution time	Memory
1163860		Mousa_Aboubaker	축구 경기장 (IOI23_soccer)	C++20	6 / 100	198 ms	31876 KiB

soccer

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

int biggest_stadium(int n, std::vector<std::vector<int>> v)
{
    int trees = 0;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            trees += v[i][j];
        }
    }

    if(trees == 1)
    {
        std::pair<int, int> idx;
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
            {
                if(v[i][j] == 1)
                {
                    idx = {i+1, j+1};
                }
            }
        }

        int res1 = n * n - idx.first * idx.second;
        int res2 = n * n - (n - idx.first + 1) * (n - idx.second + 1);
        int res3 = n * n - (n - idx.first + 1) * idx.second;
        int res4 = n * n - idx.first * (n - idx.second + 1);

        return max({res1, res2, res3, res4});
    }
    
    return n * n - trees;
}

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