Submission #1076310

#TimeUsernameProblemLanguageResultExecution timeMemory
1076310MarwenElarbiSoccer Stadium (IOI23_soccer)C++17
6 / 100
239 ms39688 KiB
#include <bits/stdc++.h>
#include "soccer.h"
using namespace std;
#define pb push_back
#define fi first
#define se second
const int nax = 2e5+5;
const int MOD = 1e9+7;

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    int n=N;
    int ans=0;
    bool test=0;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            test|=F[i][j];
            if(F[i][j]){
                ans=n*n-min({(i+1)*(j+1),(i+1)*(n-j),(1+j)*(n-i),(n-i)*(n-j)});
            }
        }
    }
    if(test) return ans;
    return n*n;
}
#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...