#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define vl vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
ll MOD = 998244353;
int biggest_stadium(int n, vector<vector<int>> f){
ll q = 0, xp = 0, yp = 0;
ff(i, 0, n){
ff(j, 0, n){
if(f[i][j] == 1){
q++;
yp = i;
xp = j;
}
}
}
if(q == 1){
ll nn = n-1;
ll minn = min({yp, xp, nn-yp, nn-xp});
return minn;
}
return n+1;
}
/*
int main(){
int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(n));
ff(i, 0, n){
ff(j, 0, n){
cin >> arr[i][j];
}
}
cout << biggest_stadium(n, arr);
}
*/
# | 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... |