Submission #1232859

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232859		m5588ohammed	축구 경기장 (IOI23_soccer)	C++20	1.50 / 100	201 ms	47364 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int arr[2001][2001],n;
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    n=N;
    int siz1=0,siz2=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]==1) siz1++;
        }
    }
    siz2=arr[0][0]+arr[0][n-1]+arr[n-1][n-1]+arr[n-1][0];
    if(siz2==siz1) return n*n-siz1;
    return -1;
}

• 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