Submission #966398

#	Time	Username	Problem	Language	Result	Execution time	Memory
966398		VMaksimoski008	Soccer Stadium (IOI23_soccer)	C++17	6 / 100	233 ms	39704 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int biggest_stadium(int N, std::vector<std::vector<int>> F) {
    int cnt = 0;

    for(int i=0; i<N; i++)
        for(int j=0; j<N; j++) cnt += (F[i][j] == 1);

    if(!cnt) return N * N;

    int x=0, y=0;
    for(int i=0; i<N; i++)
        for(int j=0; j<N; j++)
            if(F[i][j] == 1) x = i, y = j;

    return N * N - min({ (x + 1) * (y + 1), (N - x) * (y + 1), (x + 1) * (N - y), (N - x) * (N - y) });
}

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