Submission #1007089

#TimeUsernameProblemLanguageResultExecution timeMemory
1007089AmrSoccer Stadium (IOI23_soccer)C++17
0 / 100
1 ms348 KiB
#include "soccer.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; using namespace std; #define F first #define S second #define sz size() #define all(x) (x).begin(), (x).end() int biggest_stadium(int N, std::vector<std::vector<int>> F) { ll x = 0, y = 0; for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) if(F[i][j]==1) x = i, y = j; ll all = N*N; all -= min(min(min((x+1)*(y+1),(x+1)*(N-y)),(N-x)*(y+1)),(N-x)*(N-y)); return all; }
#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...