# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
973262 | raphaelp | Soccer Stadium (IOI23_soccer) | C++17 | 849 ms | 55980 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<bits/stdc++.h>
using namespace std;
int biggest_stadium(int N, vector<vector<int>> F)
{
vector<vector<int>> Nextleft(N+1, vector<int>(N+1, -1));
vector<int> dp(N+1, 0), sz(N+1, 0);
for (int i=0; i<N; i++)
{
for (int j=0; j<N; j++)
{
if (F[i][j]==1)Nextleft[i][j]=j;
else if (j>0)Nextleft[i][j]=Nextleft[i][j-1];
}
}
int maxx=0;
for (int Right=N-1; Right>=0; Right--)
{
vector<int> haut(N+1), bas(N+1),cursize(N+1);
for (int i=0; i<N; i++)
{
haut[i]=i;
bas[i]=i;
}
vector<int> ST;
for (int i=0; i<N; i++)
{
int last=i;
while(!ST.empty() && Nextleft[i][Right]>=Nextleft[ST.back()][Right])
{
last=ST.back();
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... |