Submission #841950

#	Time	Username	Problem	Language	Result	Execution time	Memory
841950		nonono	Soccer Stadium (IOI23_soccer)	C++17	6 / 100	229 ms	47556 KiB

soccer

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

int sub1(int N, vector<vector<int>> F) {
    for(int i = 0; i < N; i ++) {
        for(int j = 0; j < N; j ++) {
            if(F[i][j] == 1) {
                return max({
                    N * i + N * j - i * j,
                    N * i + N * (N - j - 1) - i * (N - j - 1),
                    N * (N - i - 1) + N * j - (N - i - 1) * j,
                    N * (N - i - 1) + N * (N - j - 1) - (N - i - 1) * (N - j - 1) 
                });
            }
        }
    }
    
    return N * N;
}

int biggest_stadium(int N, vector<vector<int>> F) {
    return sub1(N, F);
}

/*int main() {
    int N;
    cin >> N;
    
    vector<vector<int>> F(N, vector<int> (N));
    
    for(int i = 0; i < N; i ++) {
        for(int j = 0; j < N; j ++) {
            cin >> F[i][j];
        }
    }
    
    cout << biggest_stadium(N, F) << "\n";
    return 0;
}*/

• 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