oj.uz

답안 #1038045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038045 2024-07-29T12:25:23 Z erray 축구 경기장 (IOI23_soccer) C++17
6 / 100
 165 ms 31764 KB 
#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);
  }
  if (true) {
    vector<int> T(N, -1), B(N, -1), L(N, -1), R(N, -1);
    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < N; ++j) {
        if (F[i][j]) continue;
        if (T[j] == -1) T[j] = N - 1 - i;
        if (L[i] == -1) L[i] = N - 1 - j;
        B[j] = i;
        R[i] = j;
      }
    }
    int verc = 0, horc = 0;
    for (int i = 0; i < N; ++i) {
      if (L[i] != -1) {
        horc += 2 * (N - 1) - (L[i] + R[i]);
      } else {
        horc += N;
      }
      if (T[i] != -1) {
        verc += 2 * (N - 1) - (T[i] + B[i]);
      } else {
        verc += N;
      }
    }
    bool bad = (verc != tree_count || horc != tree_count);
    if (bad) {
      return 0;
    }
    debug(bad, L, R, B, T);
    int max_L = *max_element(L.begin(), L.end());
    int max_R = *max_element(R.begin(), R.end());
    int max_B = *max_element(B.begin(), B.end());
    int max_T = *max_element(T.begin(), T.end());
    int mx_H = -1;
    for (int i = 0; i < N; ++i) {
      if (L[i] == max_L && R[i] == max_R) mx_H = i;
    }
    debug(mx_H);
    if (mx_H == -1) bad = true;
    else {
      for (int i = 0; i < mx_H; ++i) {
        if (L[i] == -1) continue;
        if (L[i + 1] == -1 || L[i + 1] < L[i] || R[i + 1] < R[i]) bad = true;
      }    
      for (int i = mx_H + 1; i < N; ++i) {
        if (L[i] == -1) continue;
        if (L[i - 1] == -1 || L[i - 1] < L[i] || R[i - 1] < R[i]) bad = true;
      }
    } 
    /*
    int mx_V = -1;
    for (int i = 0; i < N; ++i) {
      if (T[i] == max_T && B[i] == max_B) mx_V = i;
    }
    debug(mx_V);
    if (mx_V == -1) bad = true;
    else {
      for (int i = 0; i < mx_V; ++i) {
        if (B[i] == -1) continue;
        if (B[i + 1] == -1 || B[i + 1] < B[i] || T[i + 1] < T[i]) bad = true;
      }    
      for (int i = mx_V + 1; i < N; ++i) {
        if (B[i] == -1) continue;
        if (B[i - 1] == -1 || B[i - 1] < B[i] || T[i - 1] < T[i]) bad = true;
      }
    }
    */
    if (bad) {
      return 0;
    } else {
      return N * N - tree_count;
    }
  }
    
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:57:9: warning: unused variable 'max_B' [-Wunused-variable]
   57 |     int max_B = *max_element(B.begin(), B.end());
      |         ^~~~~
soccer.cpp:58:9: warning: unused variable 'max_T' [-Wunused-variable]
   58 |     int max_T = *max_element(T.begin(), T.end());
      |         ^~~~~
soccer.cpp:24:46: warning: 'one_tree_j' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |     return N * N - min(i + 1, N - i) * min(j + 1, N - j);
      |                                            ~~^~~
soccer.cpp:24:26: warning: 'one_tree_i' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |     return N * N - min(i + 1, N - i) * min(j + 1, N - j);
      |                        ~~^~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 2 ms 348 KB ok
8 Correct 14 ms 2204 KB ok
9 Correct 165 ms 31764 KB ok

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 1 ms 600 KB partial
4 Partially correct 0 ms 600 KB partial
5 Incorrect 0 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 1 ms 600 KB partial
5 Partially correct 0 ms 600 KB partial
6 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 1 ms 600 KB partial
7 Partially correct 0 ms 600 KB partial
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 1 ms 600 KB partial
7 Partially correct 0 ms 600 KB partial
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 2 ms 348 KB ok
9 Correct 14 ms 2204 KB ok
10 Correct 165 ms 31764 KB ok
11 Partially correct 1 ms 600 KB partial
12 Partially correct 0 ms 600 KB partial
13 Incorrect 0 ms 348 KB wrong
14 Halted 0 ms 0 KB -