| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1364419 | retr0foxx | Soccer Stadium (IOI23_soccer) | C++20 | 136 ms | 31756 KiB |
#include "soccer.h"
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
int cnt0 = 0;
int possible = 1;
for (int i = 0; i < N; ++i)
{
int state = 0;
for (int j = 0; j < N; ++j)
{
if (F[i][j] == 0)
{
++cnt0;
if (state == 0)
state = 1;
else if (state == 2)
state = 3;
}
else
{
if (state == 1)
state = 2;
}
}
if (state == 3) possible = 0;
}
for (int i = 0; i < N; ++i)
{
int state = 0;
for (int j = 0; j < N; ++j)
{
if (F[j][i] == 0)
{
if (state == 0)
state = 1;
else if (state == 2)
state = 3;
}
else
{
if (state == 1)
state = 2;
}
}
if (state == 3) possible = 0;
}
if (possible)
return cnt0;
return 0;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
