Submission #844472

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
844472	2023-09-05T13:22:51 Z	Lib	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	253 ms	66336 KB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int val[503][503];
int cntop[503];
int cnbot[503];
int biggest_stadium(int N, std::vector<std::vector<int>> C)
{
    int n=N;
    for(int i=0;i<=n+1;i++){
		for(int k=0;k<=n+1;k++){
			val[i][k]=1;
		}
	}
    for (int i = 0; i < N ; ++i)
    {
        for (int j = 0; j < N ; ++j)
        {
            val[i+1][j+1]=C[i][j];
        }
    }
 
	int p1,p2;
	int ans=0;
	int carea;
	int mtop,mbot;
	for(int i=1;i<=n;i++){
		for(int k=1;k<=n;k++){
			for(int l=0;i-l>=0;l++){
				if(val[i-l][k]){
					cntop[k]=l;
					break;
				}
			}
			for(int l=0;i+l<=n+1;l++){
				if(val[i+l][k]){
					cnbot[k]=l;
					break;
				}
			}
			
		}
		for(int k=1;k<=n;k++){
			p1=k-1;
			p2=k+1;
			if(cntop[k]!=0){
			carea=cntop[k]+cnbot[k]-1;
			mtop=cntop[k];
			mbot=cnbot[k];
			while(p1>0&&cntop[p1]){
				mtop=min(mtop,cntop[p1]);
				mbot=min(mbot,cnbot[p1]);
				carea+=mtop+mbot-1;
				p1--;
			}
			mtop=cntop[k];
			mbot=cnbot[k];
			while(p2<=n&&cntop[p2]){
				mtop=min(mtop,cntop[p2]);
				mbot=min(mbot,cnbot[p2]);
				carea+=mtop+mbot-1;
				p2++;
			}
			ans=max(ans,carea);
			}
		}
	}
 
    return ans;
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	ok

Subtask #1

0.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	ok
2	Correct	0 ms	344 KB	ok
3	Correct	1 ms	344 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	0 ms	344 KB	ok
6	Correct	0 ms	344 KB	ok
7	Correct	3 ms	600 KB	ok
8	Correct	253 ms	3396 KB	ok
9	Runtime error	252 ms	66336 KB	Execution killed with signal 11
10	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	ok
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	0 ms	348 KB	ok
6	Correct	0 ms	344 KB	ok
7	Incorrect	0 ms	348 KB	wrong
8	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	ok
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	344 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	0 ms	348 KB	ok
6	Correct	0 ms	348 KB	ok
7	Correct	0 ms	344 KB	ok
8	Incorrect	0 ms	348 KB	wrong
9	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	ok
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	344 KB	ok
4	Correct	1 ms	344 KB	ok
5	Correct	0 ms	348 KB	ok
6	Correct	0 ms	348 KB	ok
7	Correct	0 ms	348 KB	ok
8	Correct	0 ms	348 KB	ok
9	Correct	0 ms	344 KB	ok
10	Incorrect	0 ms	348 KB	wrong
11	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	ok
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	344 KB	ok
4	Correct	1 ms	344 KB	ok
5	Correct	0 ms	348 KB	ok
6	Correct	0 ms	348 KB	ok
7	Correct	0 ms	348 KB	ok
8	Correct	0 ms	348 KB	ok
9	Correct	0 ms	344 KB	ok
10	Incorrect	0 ms	348 KB	wrong
11	Halted	0 ms	0 KB	-

Subtask #6

0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	ok
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	344 KB	ok
4	Correct	1 ms	344 KB	ok
5	Correct	0 ms	348 KB	ok
6	Correct	0 ms	344 KB	ok
7	Correct	0 ms	344 KB	ok
8	Correct	3 ms	600 KB	ok
9	Correct	253 ms	3396 KB	ok
10	Runtime error	252 ms	66336 KB	Execution killed with signal 11
11	Halted	0 ms	0 KB	-