Submission #1076293

#TimeUsernameProblemLanguageResultExecution timeMemory
1076293MarwenElarbiSoccer Stadium (IOI23_soccer)C++17
1.50 / 100
210 ms39564 KiB
#include <bits/stdc++.h> #include "soccer.h" using namespace std; #define pb push_back #define fi first #define se second const int nax = 2e5+5; const int MOD = 1e9+7; int biggest_stadium(int N, std::vector<std::vector<int>> F) { int n=N; int ans=0; bool test=0; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { test|=F[i][j]; if(F[i][j]){ ans=n*n-min({i+1+j,i+n-j,j+n-i,n-i+n-j-1}); } } } if(test) return ans; else return n*n; }
#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...