제출 #1217882

#제출 시각아이디문제언어결과실행 시간메모리
1217882qwusha축구 경기장 (IOI23_soccer)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> #include "soccer.h" using namespace std; #define fi first #define se second typedef long long ll; typedef long double ld; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); ll inf = 1e18; int biggest_stadium(int n, vector<vector<int>> f) { int res = 0; bool ok = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (f[i][j] == 1) { ok = 1; res = min(res, n * n - (i + 1) * (j + 1)); res = min(res, n * n - (n - i) * (j + 1)); res = min(res, n * n - (i + 1) * (n - j)); res = min(res, n * n - (n - i) * (n - j)); } } } if (!ok) { res = n * n; } return res; }
#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...