Submission #1244959

#TimeUsernameProblemLanguageResultExecution timeMemory
1244959CyberCow축구 경기장 (IOI23_soccer)C++20
0 / 100
0 ms328 KiB
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

int biggest_stadium(int n, vector<vector<int>> f)
{
    int st = 0, i, j;
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < n; j++)
        {
            if(f[i][j] == 1)
                break;
        }
        if(f[i][j] == 1)
            break;
    }
    if(i >= n)
    return n * n;
    if(i == 0 ||i == n - 1)
        return n * n - min(j + 1, n - j);
    if(j == 0 ||j == n - 1)
        return n * n - min(i + 1, n - i);
    return n * n - 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...