Submission #1007033

#TimeUsernameProblemLanguageResultExecution timeMemory
1007033NeroZeinSoccer Stadium (IOI23_soccer)C++17
0 / 100
0 ms348 KiB
#include "soccer.h" #include <bits/stdc++.h> using namespace std; int biggest_stadium(int n, vector<vector<int>> F) { int r = -1, c = -1; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (F[i][j] == 1) { r = i, c = j; } } } if (c == -1) { return n * n; } int ans = (c + 1) * (r) + c; //top left ans = max(ans, (c + 1) * (n - r - 1) + c);//bot left ans = max(ans, (n - r - 1) * (r) + n - c - 1);//top right ans = max(ans, (n - r - 1) * (n - c - 1) + n - c - 1); //bot right return ans; }
#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...