Submission #1232859

#TimeUsernameProblemLanguageResultExecution timeMemory
1232859m5588ohammedSoccer Stadium (IOI23_soccer)C++20
1.50 / 100
201 ms47364 KiB
#include "soccer.h" #include <bits/stdc++.h> using namespace std; int arr[2001][2001],n; int biggest_stadium(int N, std::vector<std::vector<int>> F) { n=N; int siz1=0,siz2=0; vector <array<int,2>> v; for(int i=0;i<n;i++){ for(int j=0;j<n;j++) arr[i][j]=F[i][j]; } for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(arr[i][j]==1) siz1++; } } siz2=arr[0][0]+arr[0][n-1]+arr[n-1][n-1]+arr[n-1][0]; if(siz2==siz1) return n*n-siz1; return -1; }
#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...