Submission #995792

#TimeUsernameProblemLanguageResultExecution timeMemory
995792aaaaaarrozSoccer Stadium (IOI23_soccer)C++17
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> using namespace std; int biggest_stadium(int N, vector<vector<int>> F){ int empty_cells=0; bool si_hay_arbol=false; pair<int,int>arbol; for(int i=0;i<N;i++){ for(int j=0;j<N;j++){ if(F[i][j]==0){ empty_cells++; } else{ arbol={i,j}; si_hay_arbol=true; } } } if(!si_hay_arbol){ return N*N; } else{ int a=((arbol.first+1)*(arbol.second+1))+min((arbol.first+1),(arbol.second+1)); int b=(((arbol.first+1)*(N-arbol.second))+min((arbol.first+1),(N-arbol.second))); int c=(((N-arbol.first)*(arbol.second+1))+min((N-arbol.first),(arbol.second+1))); int d=(((N-arbol.first)*(N-arbol.second))+min((N-arbol.first),(N-arbol.second))); int e=((arbol.first+1)*(arbol.second+1))+min((arbol.first+1),(arbol.second+1)); int f=(((arbol.first+1)*(N-arbol.second))); int g=(((N-arbol.first)*(arbol.second+1))); int h=(((N-arbol.first)*(N-arbol.second))); int max_rectangle=min(min(a,b),min(c,d)); max_rectangle=min(max_rectangle,min(min(e,f),min(g,h))); return (N*N)-max_rectangle; } } int main() { int N; cin>>N; vector<std::vector<int>> F(N, vector<int>(N)); for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cin>>F[i][j]; } } int res = biggest_stadium(N, F); cout<<res<<"\n"; return 0; }

Compilation message (stderr)

/usr/bin/ld: /tmp/cc2gRM8Y.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccxALoLZ.o:soccer.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status