# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
842495 | CodePlatina | Soccer Stadium (IOI23_soccer) | C++17 | 4519 ms | 63056 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 <iostream>
#include <algorithm>
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
const int INF = (int)1e9 + 7;
int biggest_stadium(int N, vector<vector<int>> F)
{
int L[N][N], R[N][N];
for(int i = 0; i < N; ++i)
{
for(int j = 0; j < N; ++j)
{
if(F[i][j]) L[i][j] = j;
else L[i][j] = (j ? L[i][j - 1] : -1);
}
for(int j = N - 1; j >= 0; --j)
{
if(F[i][j]) R[i][j] = j;
else R[i][j] = (j < N - 1 ? R[i][j + 1] : N);
}
}
int ret = 0;
for(int i = 0; i < N; ++i)
# | 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... |