제출 #313709

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
313709	2020-10-16 19:31:02	Temmie	Furniture (JOI20_furniture)	C++17	100 / 100	416 ms	24032 KiB

furniture

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
void place(int X, int Y, std::queue <std::pair <int, int>>& q, std::vector <int>& le, std::vector <int>& ri, std::vector <std::vector <int>>& g, std::vector <std::vector <int>>& ou, std::vector <std::vector <int>>& in, int n, int m) {
  q.push({ X, Y });
  while (q.size()) {
    auto p = q.front(); q.pop();
    int x = p.first, y = p.second;
    if (g[x][y]) continue;
    g[x][y] = 1;
    if (x && !--ou[x - 1][y]) q.push({ x - 1, y });
    if (y && !--ou[x][y - 1]) q.push({ x, y - 1 });
    if (x + 1 < n && !--in[x + 1][y]) q.push({ x + 1, y });
    if (y + 1 < m && !--in[x][y + 1]) q.push({ x, y + 1 });
    while (le[x + y] == x && g[x][y]) le[x + y]++, x++, y--;
    while (ri[x + y] == x && g[x][y]) ri[x + y]--, x--, y++;
  }
}
int main() {
  std::ios::sync_with_stdio(0); std::cin.tie(0);
  
  int n, m; std::cin >> n >> m;
  std::vector <std::vector <int>> g(n, std::vector <int> (m)), ou(g), in(g);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (j + 1 < m) ou[i][j]++, in[i][j + 1]++;
      if (i + 1 < n) ou[i][j]++, in[i + 1][j]++;
    }
  }
  std::vector <int> le(n + m, n), ri(n + m, 0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 95 / 95