Submission #899634

#	Time	Username	Problem	Language	Result	Execution time	Memory
899634		Szil	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	1 ms	440 KiB

soccer

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int solve1(int N, vector<vector<int>> F) {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (F[i][j]) {
                int up = j+1;
                int down = N-j;
                int left = i+1;
                int right = N-i;

                vector<int> x = {
                    up*right, right*down, down*left, left*up
                };

                int best = *min_element(x.begin(), x.end());
                return N*N-best;
            }
        }
    }
}

int biggest_stadium(int N, vector<vector<int>> F) {
    int trees = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (F[i][j]) trees++;
        }
    }

    if (trees == 1) return solve1(N, F);
    return 0;
}

Compilation message (stderr)

soccer.cpp: In function 'int solve1(int, std::vector<std::vector<int> >)':
soccer.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^

• 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