제출 #899634

#제출 시각아이디문제언어결과실행 시간메모리
899634SzilSoccer Stadium (IOI23_soccer)C++17
0 / 100
1 ms440 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int solve1(int N, vector<vector<int>> F) { for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (F[i][j]) { int up = j+1; int down = N-j; int left = i+1; int right = N-i; vector<int> x = { up*right, right*down, down*left, left*up }; int best = *min_element(x.begin(), x.end()); return N*N-best; } } } } int biggest_stadium(int N, vector<vector<int>> F) { int trees = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (F[i][j]) trees++; } } if (trees == 1) return solve1(N, F); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

soccer.cpp: In function 'int solve1(int, std::vector<std::vector<int> >)':
soccer.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^
#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...