# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082685 | HappyCapybara | Soccer Stadium (IOI23_soccer) | C++17 | 243 ms | 39816 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
int biggest_stadium(int N, vector<vector<int>> F){
int res = 0;
vector<pair<int,int>> c;
for (int i=0; i<N; i++){
int b = 0;
for (int j=0; j<N; j++){
if (!F[i][j]){
if (b == 0) b = 1;
if (b == 2) return 0;
res++;
int nb = 0;
if (i > 0 && !F[i-1][j]) nb++;
if (i < N-1 && !F[i+1][j]) nb++;
if (j > 0 && !F[i][j-1]) nb++;
if (j < N-1 && !F[i][j+1]) nb++;
if (nb <= 2) c.push_back({i, j});
}
else {
if (b == 1) b = 2;
}
}
}
for (int j=0; j<N; j++){
int b = 0;
for (int i=0; i<N; i++){
if (!F[i][j]){
if (b == 0) b = 1;
if (b == 2) return 0;
}
else {
if (b == 1) b = 2;
}
}
}
for (int i=0; i<c.size()-1; i++){
for (int j=i+1; j<c.size(); j++){
if (F[c[i].first][c[j].second] && F[c[j].first][c[i].second]) return 0;
}
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |