Submission #1194610

#TimeUsernameProblemLanguageResultExecution timeMemory
1194610Ak_16축구 경기장 (IOI23_soccer)C++20
0 / 100
0 ms328 KiB
#include <iostream>
#include <vector>
using namespace std;

int fin;

int biggest_stadium(int n, vector<vector<int>> f){
  
  
  
  int r,c;
  
  for(int i=0; i<n; i++){
    for(int j=0; j<n; j++){
      if(f[i][j]==1){
        r=i;
        c=j;
      }
    }
  }
  
  r = min(r, n-1-r);
  c = min(c, n-1-c);
  
  fin = n*n;
  fin -= (r+1)*(c+1);
  
  return fin;
  
}
#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...