Submission #1232865

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232865		m5588ohammed	Soccer Stadium (IOI23_soccer)	C++20	1.50 / 100	202 ms	47500 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int arr[2001][2001],vis[2001][2001],n;
bool valid(int i,int j){
    if(i>=n||j>=n||i<0||j<0||arr[i][j]==1||vis[i][j]==1) return 0;
    return 1;
}
void dfs(int i,int j){
    vis[i][j]=1;
    if(valid(i+1,j)==1) dfs(i+1,j);
    if(valid(i-1,j)==1) dfs(i-1,j);
    if(valid(i,j+1)==1) dfs(i,j+1);
    if(valid(i,j-1)==1) dfs(i,j-1);
    return;
}
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    n=N;
    int siz=0,cnt=0;
    vector <array<int,2>> v;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            arr[i][j]=F[i][j];
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(arr[i][j]==0) siz++;
            else{
                if(valid(i-1,j)+valid(i+1,j)==2||valid(i,j-1)+valid(i,j+1)==2) return -1;    
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(vis[i][j]==0&&arr[i][j]==0){
                cnt++;
                dfs(i,j);
            }
        }
    }
    if(cnt>1) return -1;
    return siz;
}

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