oj.uz

Submission #102847

# Submission time Handle Problem Language Result Execution time Memory
102847 2019-03-28T01:02:19 Z wxh010910 Seats (IOI18_seats) C++17
100 / 100
 1880 ms 126008 KB 
#include <bits/stdc++.h>
#include "seats.h"

using namespace std;

class segtree_t {
 private:

  struct node_t {
    int tag, value, answer;
  };

  vector<node_t> tree;
  int n;

  void apply(int x, int value) {
    tree[x].tag += value;
    tree[x].value += value;
  }

  void push_up(int x, int z) {
    tree[x].value = min(tree[x + 1].value, tree[z].value);
    tree[x].answer = 0;
    if (tree[x].value == tree[x + 1].value) {
      tree[x].answer += tree[x + 1].answer;
    }
    if (tree[x].value == tree[z].value) {
      tree[x].answer += tree[z].answer;
    }
  }

  void push_down(int x, int z) {
    if (tree[x].tag) {
      apply(x + 1, tree[x].tag);
      apply(z, tree[x].tag);
      tree[x].tag = 0;
    }
  }

  void build(int x, int l, int r, vector<int> &a) {
    if (l == r) {
      tree[x].value = a[l];
      tree[x].answer = 1;
    } else {
      int y = l + r >> 1, z = x + (y - l + 1 << 1);
      build(x + 1, l, y, a);
      build(z, y + 1, r, a);
      push_up(x, z);
    }
  }

  void modify(int x, int l, int r, int ql, int qr, int value) {
    if (l == ql && r == qr) {
      apply(x, value);
    } else {
      int y = l + r >> 1, z = x + (y - l + 1 << 1);
      push_down(x, z);
      if (qr <= y) {
        modify(x + 1, l, y, ql, qr, value);
      } else if (ql > y) {
        modify(z, y + 1, r, ql, qr, value);
      } else {
        modify(x + 1, l, y, ql, y, value);
        modify(z, y + 1, r, y + 1, qr, value);
      }
      push_up(x, z);
    }
  }

 public:
  void init(vector<int> a) {
    n = a.size();
    tree.resize((n << 1) - 1);
    build(0, 0, n - 1, a);
  }

  void modify(int l, int r, int value) {
    if (l <= r) {
      modify(0, 0, n - 1, l, r, value);
    }
  }

  int query() {
    return tree[0].answer;
  }
};

const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};

vector<vector<int>> board;
segtree_t segtree;
vector<int> r, c;
int n, m;

bool in(int x, int y) {
  return x >= 0 && x < n && y >= 0 && y < m;
}

void give_initial_chart(int _n, int _m, vector<int> _r, vector<int> _c) {
  n = _n;
  m = _m;
  r = _r;
  c = _c;
  board = vector<vector<int>> (n, vector<int> (m));
  for (int i = 0; i < n * m; ++i) {
    board[r[i]][c[i]] = i;
  }
  vector<int> answer(n * m);
  int current = 0;
  for (int i = 0; i < n * m; ++i) {
    int x = r[i], y = c[i], degree = 0;
    for (int j = 0; j < 4; ++j) {
      int nx = x + dx[j], ny = y + dy[j];
      if (in(nx, ny)) {
        if (board[nx][ny] > i) {
          int degree = 0;
          for (int k = 0; k < 4; ++k) {
            int tx = nx + dx[k], ty = ny + dy[k];
            if (in(tx, ty) && board[tx][ty] <= i) {
              ++degree;
            }
          }
          if (degree == 2) {
            ++current;
          }
        } else {
          ++degree;
        }
      }
    }
    if (degree >= 2) {
      --current;
    }
    if (in(x, y + 1) && board[x][y + 1] <= i && (!in(x - 1, y + 1) || board[x - 1][y + 1] > i)) {
      --current;
    }
    if (in(x + 1, y) && board[x + 1][y] <= i && (!in(x + 1, y - 1) || board[x + 1][y - 1] > i)) {
      --current;
    }
    if ((!in(x - 1, y) || board[x - 1][y] > i) && (!in(x, y - 1) || board[x][y - 1] > i)) {
      ++current;
    }
    answer[i] = current;
  }
  segtree.init(answer);
}

void modify(int x, int y, int value) {
  vector<int> neighbor;
  {
    neighbor.clear();
    for (int i = 0; i < 4; ++i) {
      int nx = x + dx[i], ny = y + dy[i];
      if (in(nx, ny)) {
        neighbor.push_back(board[nx][ny]);
      }
    }
    sort(neighbor.begin(), neighbor.end());
    if (neighbor.size() >= 2) {
      segtree.modify(neighbor[1], board[x][y] - 1, -1);
      segtree.modify(neighbor[1], value - 1, 1);
    }
  }
  for (int i = 0; i < 4; ++i) {
    int nx = x + dx[i], ny = y + dy[i];
    if (in(nx, ny)) {
      neighbor.clear();
      for (int j = 0; j < 4; ++j) {
        int tx = nx + dx[j], ty = ny + dy[j];
        if (in(tx, ty)) {
          neighbor.push_back(board[tx][ty]);
        }
      }
      sort(neighbor.begin(), neighbor.end());
      if (neighbor.size() >= 2) {
        segtree.modify(neighbor[1], board[nx][ny] - 1, -1);
      }
      for (int j = 0; j < neighbor.size(); ++j) {
        if (neighbor[j] == board[x][y]) {
          neighbor[j] = value;
          break;
        }
      }
      sort(neighbor.begin(), neighbor.end());
      if (neighbor.size() >= 2) {
        segtree.modify(neighbor[1], board[nx][ny] - 1, 1);
      }
    }
  }
  {
    int bound = n * m;
    if (in(x - 1, y)) {
      bound = min(bound, board[x - 1][y]);
    }
    if (in(x, y - 1)) {
      bound = min(bound, board[x][y - 1]);
    }
    segtree.modify(board[x][y], bound - 1, -1);
    segtree.modify(value, bound - 1, 1);
  }
  if (in(x + 1, y)) {
    int bound = n * m;
    if (in(x + 1, y - 1)) {
      bound = min(bound, board[x + 1][y - 1]);
    }
    segtree.modify(board[x + 1][y], min(bound, board[x][y]) - 1, -1);
    segtree.modify(board[x + 1][y], min(bound, value) - 1, 1);
  }
  if (in(x, y + 1)) {
    int bound = n * m;
    if (in(x - 1, y + 1)) {
      bound = min(bound, board[x - 1][y + 1]);
    }
    segtree.modify(board[x][y + 1], min(bound, board[x][y]) - 1, -1);
    segtree.modify(board[x][y + 1], min(bound, value) - 1, 1);
  }
  board[x][y] = value;
}

int swap_seats(int a, int b) {
  modify(r[a], c[a], b);
  modify(r[b], c[b], a);
  swap(r[a], r[b]);
  swap(c[a], c[b]);
  return segtree.query();
}

Compilation message

seats.cpp: In member function 'void segtree_t::build(int, int, int, std::vector<int>&)':
seats.cpp:45:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
       int y = l + r >> 1, z = x + (y - l + 1 << 1);
               ~~^~~
seats.cpp:45:42: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
       int y = l + r >> 1, z = x + (y - l + 1 << 1);
                                    ~~~~~~^~~
seats.cpp: In member function 'void segtree_t::modify(int, int, int, int, int, int)':
seats.cpp:56:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
       int y = l + r >> 1, z = x + (y - l + 1 << 1);
               ~~^~~
seats.cpp:56:42: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
       int y = l + r >> 1, z = x + (y - l + 1 << 1);
                                    ~~~~~~^~~
seats.cpp: In function 'void modify(int, int, int)':
seats.cpp:179:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for (int j = 0; j < neighbor.size(); ++j) {
                       ~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 484 KB Output is correct
2 Correct 17 ms 504 KB Output is correct
3 Correct 22 ms 556 KB Output is correct
4 Correct 13 ms 496 KB Output is correct
5 Correct 10 ms 488 KB Output is correct
6 Correct 26 ms 512 KB Output is correct
7 Correct 20 ms 484 KB Output is correct
8 Correct 20 ms 516 KB Output is correct
9 Correct 21 ms 532 KB Output is correct
10 Correct 22 ms 592 KB Output is correct
11 Correct 28 ms 552 KB Output is correct
12 Correct 13 ms 484 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 484 KB Output is correct
2 Correct 17 ms 504 KB Output is correct
3 Correct 22 ms 556 KB Output is correct
4 Correct 13 ms 496 KB Output is correct
5 Correct 10 ms 488 KB Output is correct
6 Correct 26 ms 512 KB Output is correct
7 Correct 20 ms 484 KB Output is correct
8 Correct 20 ms 516 KB Output is correct
9 Correct 21 ms 532 KB Output is correct
10 Correct 22 ms 592 KB Output is correct
11 Correct 28 ms 552 KB Output is correct
12 Correct 13 ms 484 KB Output is correct
13 Correct 49 ms 1184 KB Output is correct
14 Correct 64 ms 1152 KB Output is correct
15 Correct 41 ms 1152 KB Output is correct
16 Correct 22 ms 1664 KB Output is correct
17 Correct 36 ms 1152 KB Output is correct
18 Correct 34 ms 1180 KB Output is correct
19 Correct 34 ms 1152 KB Output is correct
20 Correct 27 ms 1408 KB Output is correct
21 Correct 21 ms 1180 KB Output is correct
22 Correct 24 ms 1656 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 611 ms 75188 KB Output is correct
2 Correct 418 ms 75156 KB Output is correct
3 Correct 402 ms 75164 KB Output is correct
4 Correct 412 ms 75192 KB Output is correct
5 Correct 437 ms 75160 KB Output is correct
6 Correct 447 ms 75156 KB Output is correct
7 Correct 531 ms 75168 KB Output is correct
8 Correct 443 ms 75196 KB Output is correct
9 Correct 436 ms 75164 KB Output is correct
10 Correct 577 ms 75184 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 1196 KB Output is correct
2 Correct 88 ms 6960 KB Output is correct
3 Correct 482 ms 75180 KB Output is correct
4 Correct 662 ms 75196 KB Output is correct
5 Correct 408 ms 75200 KB Output is correct
6 Correct 1183 ms 126008 KB Output is correct
7 Correct 430 ms 75140 KB Output is correct
8 Correct 510 ms 75264 KB Output is correct
9 Correct 536 ms 75528 KB Output is correct
10 Correct 457 ms 78248 KB Output is correct
11 Correct 455 ms 98608 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2084 KB Output is correct
2 Correct 85 ms 2004 KB Output is correct
3 Correct 125 ms 2112 KB Output is correct
4 Correct 159 ms 2144 KB Output is correct
5 Correct 221 ms 2752 KB Output is correct
6 Correct 786 ms 76148 KB Output is correct
7 Correct 806 ms 76004 KB Output is correct
8 Correct 767 ms 76124 KB Output is correct
9 Correct 1056 ms 76100 KB Output is correct
10 Correct 624 ms 75996 KB Output is correct
11 Correct 780 ms 76136 KB Output is correct
12 Correct 582 ms 76024 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 484 KB Output is correct
2 Correct 17 ms 504 KB Output is correct
3 Correct 22 ms 556 KB Output is correct
4 Correct 13 ms 496 KB Output is correct
5 Correct 10 ms 488 KB Output is correct
6 Correct 26 ms 512 KB Output is correct
7 Correct 20 ms 484 KB Output is correct
8 Correct 20 ms 516 KB Output is correct
9 Correct 21 ms 532 KB Output is correct
10 Correct 22 ms 592 KB Output is correct
11 Correct 28 ms 552 KB Output is correct
12 Correct 13 ms 484 KB Output is correct
13 Correct 49 ms 1184 KB Output is correct
14 Correct 64 ms 1152 KB Output is correct
15 Correct 41 ms 1152 KB Output is correct
16 Correct 22 ms 1664 KB Output is correct
17 Correct 36 ms 1152 KB Output is correct
18 Correct 34 ms 1180 KB Output is correct
19 Correct 34 ms 1152 KB Output is correct
20 Correct 27 ms 1408 KB Output is correct
21 Correct 21 ms 1180 KB Output is correct
22 Correct 24 ms 1656 KB Output is correct
23 Correct 611 ms 75188 KB Output is correct
24 Correct 418 ms 75156 KB Output is correct
25 Correct 402 ms 75164 KB Output is correct
26 Correct 412 ms 75192 KB Output is correct
27 Correct 437 ms 75160 KB Output is correct
28 Correct 447 ms 75156 KB Output is correct
29 Correct 531 ms 75168 KB Output is correct
30 Correct 443 ms 75196 KB Output is correct
31 Correct 436 ms 75164 KB Output is correct
32 Correct 577 ms 75184 KB Output is correct
33 Correct 42 ms 1196 KB Output is correct
34 Correct 88 ms 6960 KB Output is correct
35 Correct 482 ms 75180 KB Output is correct
36 Correct 662 ms 75196 KB Output is correct
37 Correct 408 ms 75200 KB Output is correct
38 Correct 1183 ms 126008 KB Output is correct
39 Correct 430 ms 75140 KB Output is correct
40 Correct 510 ms 75264 KB Output is correct
41 Correct 536 ms 75528 KB Output is correct
42 Correct 457 ms 78248 KB Output is correct
43 Correct 455 ms 98608 KB Output is correct
44 Correct 54 ms 2084 KB Output is correct
45 Correct 85 ms 2004 KB Output is correct
46 Correct 125 ms 2112 KB Output is correct
47 Correct 159 ms 2144 KB Output is correct
48 Correct 221 ms 2752 KB Output is correct
49 Correct 786 ms 76148 KB Output is correct
50 Correct 806 ms 76004 KB Output is correct
51 Correct 767 ms 76124 KB Output is correct
52 Correct 1056 ms 76100 KB Output is correct
53 Correct 624 ms 75996 KB Output is correct
54 Correct 780 ms 76136 KB Output is correct
55 Correct 582 ms 76024 KB Output is correct
56 Correct 115 ms 2036 KB Output is correct
57 Correct 215 ms 2072 KB Output is correct
58 Correct 336 ms 2632 KB Output is correct
59 Correct 1202 ms 76072 KB Output is correct
60 Correct 1711 ms 76176 KB Output is correct
61 Correct 904 ms 76064 KB Output is correct
62 Correct 817 ms 76108 KB Output is correct
63 Correct 1326 ms 76164 KB Output is correct
64 Correct 1168 ms 76068 KB Output is correct
65 Correct 1117 ms 76216 KB Output is correct
66 Correct 1396 ms 76464 KB Output is correct
67 Correct 1166 ms 79236 KB Output is correct
68 Correct 894 ms 90420 KB Output is correct
69 Correct 1880 ms 99580 KB Output is correct