Submission #1240246

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240246		candi_ositos	Soccer Stadium (IOI23_soccer)	C++20	0 / 100	0 ms	324 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int biggest_stadium(int N, vector <vector <int> > F)
{
    int lmt=-1, rmt=-1, umt=-1, dmt=-1, lms=-1, rms=-1, ums=-1, dms=-1;
    for(int i=0; i<N; ++i){
        for(int j=0; j<N; ++j){
            if(F[i][j]){
                if(i>0){
                    if(!F[i-1][j] && umt==-1){
                        umt=i;
                    }
                }
                if(j>0){
                    if(!F[i][j-1] && (lmt==-1 || lmt>j)){
                        lmt=j;
                    }
                }
                if(i<N-1){
                    if(!F[i+1][j]){
                        dmt=i;
                    }
                }
                if(j<N-1){
                    if(!F[i][j+1] && rmt<j){
                        rmt=j;
                    }
                }
            }
            else{
                dms=i;
                if(ums==-1){
                    ums=i;
                }
                if(rms<j){
                    rms=j;
                }
                if(lms>j || lms==-1){
                    lms=j;
                }
            }
        }
    }
    if(umt<=dmt+1 || lmt<=rmt+1){
        return 0;
    }
    return 2*(dms-ums+rms-lms)+4;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30