Submission #1037957

#TimeUsernameProblemLanguageResultExecution timeMemory
1037957erray축구 경기장 (IOI23_soccer)C++17
6 / 100
187 ms31828 KiB
#include "soccer.h"
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG 
  #include "/home/ioi/egoi2024/d2/debug.h"
#else 
  #define debug(...) void(37)
#endif

int biggest_stadium(int N, std::vector<std::vector<int>> F) {
    int tree_count = 0, one_tree_i, one_tree_j;
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
      if (F[i][j]) {
        tree_count++;
        one_tree_i = i, one_tree_j = j;
      }
    }
    if (tree_count <= 1) {
      if (tree_count == 0) return N * N;
      int i = one_tree_i;
      int j = one_tree_j;
      return N * N - min(i + 1, N - i) * min(j + 1, N - j);
    }
}

Compilation message (stderr)

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