Submission #1236551

#TimeUsernameProblemLanguageResultExecution timeMemory
1236551repsakSoccer Stadium (IOI23_soccer)C++20
0 / 100
0 ms328 KiB
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

int biggest_stadium(int N, vector<vector<int>> F)
{   
    int ti, tj;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N ;j++){
            if (F[i][j] == 1){
                ti = j; tj = i;
                break;
            }
        }
    }
    int xtl = ti * tj;
    int xtr = (N - 1 - ti) * tj;
    int xbr = (N - 1 - ti) * (N - 1 - tj);
    int xbl = ti * (N - 1 - tj);

    int left = ti * N;
    int up = tj * N;

    int right = (N - 1 - ti) * N;
    int down = (N - 1 - tj) * N;

    return max({
        left + up - xtl,
        left + down - xbl,
        right + up - xtr,
        right + down - xbr
    });
}

// #include "grader.cpp"
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...