제출 #1195652

#제출 시각아이디문제언어결과실행 시간메모리
1195652mannshah1211축구 경기장 (IOI23_soccer)C++20
6 / 100
189 ms31768 KiB
#include "soccer.h" #include <bits/stdc++.h> using namespace std; int biggest_stadium(int n, vector<vector<int>> f) { int tree_i = -1, tree_j = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (f[i][j] == 1) { tree_i = i; tree_j = j; } } } if (tree_i == -1 && tree_j == -1) { return n * n; } auto edging = [&](int x) { if (x == 0) { return true; } if (x == n - 1) { return true; } return false; }; if (edging(tree_i) && edging(tree_j)) { return n * n - 1; } return n * n - min({(tree_i + 1) * (tree_j + 1), (n - tree_i) * (tree_j + 1), (tree_i + 1) * (n - tree_j), (n - tree_i) * (n - tree_j)}); }
#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...