# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023549 | LIF | Soccer Stadium (IOI23_soccer) | C++17 | 0 ms | 448 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
int FF[2005][2005];
int FF2[2005][2005];
int biggest_stadium(int N, vector<vector<int>> F)
{
for(int i=0;i<F.size();i++)
{
for(int j=0;j<F[i].size();j++)FF[i+1][j+1] = F[i][j];
}
bool exis = false;
int ii = -1;
int jj = -1;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if(FF[i][j] == 1)
{
exis = true;
ii = i;
jj = j;
}
}
}
if(exis == false)return N*N;
int ans1 = 0;
int ans2 = 0;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if((j > jj) || i > ii)ans1++;
}
}
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if((j < jj) || i < ii)ans2++;
}
}
return max(ans1,ans2);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |