oj.uz

답안 #222611

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
222611 2020-04-13T12:26:09 Z rama_pang 자리 배치 (IOI18_seats) C++14
100 / 100
 2488 ms 133880 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;

class SegmentTree {
 private:
  struct Data {
    pair<int, int> value;
    int cnt;

    Data() {}
    Data(pair<int, int> v, int c) : value(v), cnt(c) {}

    friend Data Merge(const Data &a, const Data &b) {
      if (a.value < b.value) {
        return a;
      } else if (a.value > b.value) {
        return b;
      } else {
        return Data(a.value, a.cnt + b.cnt);
      }
    }
  };

  int sz;
  vector<Data> tree;
  vector<pair<int, int>> lazy;

  void Apply(int n, int a, int b) {
    tree[n].value.first += a;
    tree[n].value.second += b;
    lazy[n].first += a;
    lazy[n].second += b;
  }

  void Push(int n, int lc, int rc) {
    Apply(lc, lazy[n].first, lazy[n].second);
    Apply(rc, lazy[n].first, lazy[n].second);
    lazy[n].first = lazy[n].second = 0;
  }

  void Pull(int n, int lc, int rc) {
    tree[n] = Merge(tree[lc], tree[rc]);
  }

  void Update(int n, int tl, int tr, int l, int r, int a, int b) {
    if (tr < l || r < tl || tl > tr || l > r) return;
    if (l <= tl && tr <= r) return Apply(n, a, b);
    int mid = (tl + tr) / 2;
    int lc = n + 1;
    int rc = n + 2 * (mid - tl + 1);
    Push(n, lc, rc);
    Update(lc, tl, mid, l, r, a, b);
    Update(rc, mid + 1, tr, l, r, a, b);
    Pull(n, lc, rc);
  }

  void Build(int n, int tl, int tr) {
    if (tl == tr) return void(tree[n] = Data({0, 0}, 1));
    int mid = (tl + tr) / 2;
    int lc = n + 1;
    int rc = n + 2 * (mid - tl + 1);
    Build(lc, tl, mid);
    Build(rc, mid + 1, tr);
    Pull(n, lc, rc);
  }

 public:
  SegmentTree() {}
  SegmentTree(int n) : sz(n) {
    tree.resize(2 * sz);
    lazy.resize(2 * sz);
    Build(1, 0, sz - 1);
  }

  void Update(int l, int r, int a, int b) {
    return Update(1, 0, sz - 1, l, r, a, b);
  }

  int Query() {
    return tree[1].value == make_pair(4, 0) ? tree[1].cnt : 0; // 4 squares with 1 black cell, 0 squares with 3 black cells
  }
};

int H, W;
vector<int> R, C; // Rows and Columns of each student
vector<vector<int>> A; // The seating chart

SegmentTree SegTree;

int get_value(int i, int j) {
  if (!(0 <= i && i < H && 0 <= j && j < W)) return H * W;
  return A[i][j];
}

int square_count(int r, int c, int a) { // count black squares in 2-by-2 square, where the top left corner is (r, c)
  int res = 0; // values <= a is considered a black square
  if (get_value(r,     c    ) <= a) res++;
  if (get_value(r + 1, c    ) <= a) res++;
  if (get_value(r,     c + 1) <= a) res++;
  if (get_value(r + 1, c + 1) <= a) res++;
  return res;
}

void update(int r, int c, int sgn) {
  vector<int> cnt(5, 0);
  
  cnt[square_count(r - 1, c - 1, get_value(r, c) - 1)] -= sgn;
  cnt[square_count(r    , c - 1, get_value(r, c) - 1)] -= sgn;
  cnt[square_count(r - 1, c    , get_value(r, c) - 1)] -= sgn;
  cnt[square_count(r    , c    , get_value(r, c) - 1)] -= sgn;
  
  cnt[square_count(r - 1, c - 1, get_value(r, c))] += sgn;
  cnt[square_count(r    , c - 1, get_value(r, c))] += sgn;
  cnt[square_count(r - 1, c    , get_value(r, c))] += sgn;
  cnt[square_count(r    , c    , get_value(r, c))] += sgn;
  
  SegTree.Update(get_value(r, c), H * W - 1, cnt[1], cnt[3]);
}

void give_initial_chart(int H_, int W_, vector<int> R_, vector<int> C_) {
  H = H_, W = W_, R = R_, C = C_;
  SegTree = SegmentTree(H * W);
  A.assign(H, vector<int>(W, H * W));

  for (int i = 0; i < H * W; i++) {
    A[R[i]][C[i]] = i;
    update(R[i], C[i], +1);
  }
}

int swap_seats(int a, int b) {
  vector<pair<int, int>> ls; // list of affected cells
  for (int x = -1; x <= 1; x++) {
    for (int y = -1; y <= 1; y++) {
      ls.emplace_back(R[a] + x, C[a] + y);
      ls.emplace_back(R[b] + x, C[b] + y);
    }
  }
  sort(begin(ls), end(ls));
  ls.resize(unique(begin(ls), end(ls)) - begin(ls));

  for (auto i : ls) update(i.first, i.second, -1);
  swap(R[a], R[b]), swap(C[a], C[b]);
  swap(A[R[a]][C[a]], A[R[b]][C[b]]);
  for (auto i : ls) update(i.first, i.second, +1);
  
  return SegTree.Query();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 504 KB Output is correct
2 Correct 53 ms 504 KB Output is correct
3 Correct 60 ms 496 KB Output is correct
4 Correct 45 ms 504 KB Output is correct
5 Correct 48 ms 508 KB Output is correct
6 Correct 60 ms 504 KB Output is correct
7 Correct 57 ms 508 KB Output is correct
8 Correct 59 ms 504 KB Output is correct
9 Correct 59 ms 512 KB Output is correct
10 Correct 59 ms 504 KB Output is correct
11 Correct 56 ms 632 KB Output is correct
12 Correct 44 ms 504 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 504 KB Output is correct
2 Correct 53 ms 504 KB Output is correct
3 Correct 60 ms 496 KB Output is correct
4 Correct 45 ms 504 KB Output is correct
5 Correct 48 ms 508 KB Output is correct
6 Correct 60 ms 504 KB Output is correct
7 Correct 57 ms 508 KB Output is correct
8 Correct 59 ms 504 KB Output is correct
9 Correct 59 ms 512 KB Output is correct
10 Correct 59 ms 504 KB Output is correct
11 Correct 56 ms 632 KB Output is correct
12 Correct 44 ms 504 KB Output is correct
13 Correct 95 ms 1272 KB Output is correct
14 Correct 95 ms 1272 KB Output is correct
15 Correct 59 ms 1280 KB Output is correct
16 Correct 64 ms 1784 KB Output is correct
17 Correct 79 ms 1280 KB Output is correct
18 Correct 93 ms 1272 KB Output is correct
19 Correct 93 ms 1280 KB Output is correct
20 Correct 81 ms 1528 KB Output is correct
21 Correct 59 ms 1280 KB Output is correct
22 Correct 63 ms 1784 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1111 ms 83064 KB Output is correct
2 Correct 1070 ms 83008 KB Output is correct
3 Correct 1034 ms 83168 KB Output is correct
4 Correct 998 ms 83064 KB Output is correct
5 Correct 1006 ms 83080 KB Output is correct
6 Correct 1053 ms 83192 KB Output is correct
7 Correct 1034 ms 83064 KB Output is correct
8 Correct 1046 ms 83064 KB Output is correct
9 Correct 1034 ms 83196 KB Output is correct
10 Correct 1028 ms 83192 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 1280 KB Output is correct
2 Correct 179 ms 7672 KB Output is correct
3 Correct 1008 ms 83064 KB Output is correct
4 Correct 1158 ms 83064 KB Output is correct
5 Correct 902 ms 86904 KB Output is correct
6 Correct 1250 ms 133880 KB Output is correct
7 Correct 996 ms 84216 KB Output is correct
8 Correct 1008 ms 83064 KB Output is correct
9 Correct 1036 ms 83320 KB Output is correct
10 Correct 1037 ms 86008 KB Output is correct
11 Correct 1035 ms 106488 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 2048 KB Output is correct
2 Correct 372 ms 2036 KB Output is correct
3 Correct 410 ms 2040 KB Output is correct
4 Correct 449 ms 2164 KB Output is correct
5 Correct 501 ms 2872 KB Output is correct
6 Correct 1539 ms 87800 KB Output is correct
7 Correct 1567 ms 87800 KB Output is correct
8 Correct 1524 ms 88072 KB Output is correct
9 Correct 1604 ms 87800 KB Output is correct
10 Correct 1455 ms 87928 KB Output is correct
11 Correct 1443 ms 88072 KB Output is correct
12 Correct 1469 ms 87800 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 504 KB Output is correct
2 Correct 53 ms 504 KB Output is correct
3 Correct 60 ms 496 KB Output is correct
4 Correct 45 ms 504 KB Output is correct
5 Correct 48 ms 508 KB Output is correct
6 Correct 60 ms 504 KB Output is correct
7 Correct 57 ms 508 KB Output is correct
8 Correct 59 ms 504 KB Output is correct
9 Correct 59 ms 512 KB Output is correct
10 Correct 59 ms 504 KB Output is correct
11 Correct 56 ms 632 KB Output is correct
12 Correct 44 ms 504 KB Output is correct
13 Correct 95 ms 1272 KB Output is correct
14 Correct 95 ms 1272 KB Output is correct
15 Correct 59 ms 1280 KB Output is correct
16 Correct 64 ms 1784 KB Output is correct
17 Correct 79 ms 1280 KB Output is correct
18 Correct 93 ms 1272 KB Output is correct
19 Correct 93 ms 1280 KB Output is correct
20 Correct 81 ms 1528 KB Output is correct
21 Correct 59 ms 1280 KB Output is correct
22 Correct 63 ms 1784 KB Output is correct
23 Correct 1111 ms 83064 KB Output is correct
24 Correct 1070 ms 83008 KB Output is correct
25 Correct 1034 ms 83168 KB Output is correct
26 Correct 998 ms 83064 KB Output is correct
27 Correct 1006 ms 83080 KB Output is correct
28 Correct 1053 ms 83192 KB Output is correct
29 Correct 1034 ms 83064 KB Output is correct
30 Correct 1046 ms 83064 KB Output is correct
31 Correct 1034 ms 83196 KB Output is correct
32 Correct 1028 ms 83192 KB Output is correct
33 Correct 92 ms 1280 KB Output is correct
34 Correct 179 ms 7672 KB Output is correct
35 Correct 1008 ms 83064 KB Output is correct
36 Correct 1158 ms 83064 KB Output is correct
37 Correct 902 ms 86904 KB Output is correct
38 Correct 1250 ms 133880 KB Output is correct
39 Correct 996 ms 84216 KB Output is correct
40 Correct 1008 ms 83064 KB Output is correct
41 Correct 1036 ms 83320 KB Output is correct
42 Correct 1037 ms 86008 KB Output is correct
43 Correct 1035 ms 106488 KB Output is correct
44 Correct 312 ms 2048 KB Output is correct
45 Correct 372 ms 2036 KB Output is correct
46 Correct 410 ms 2040 KB Output is correct
47 Correct 449 ms 2164 KB Output is correct
48 Correct 501 ms 2872 KB Output is correct
49 Correct 1539 ms 87800 KB Output is correct
50 Correct 1567 ms 87800 KB Output is correct
51 Correct 1524 ms 88072 KB Output is correct
52 Correct 1604 ms 87800 KB Output is correct
53 Correct 1455 ms 87928 KB Output is correct
54 Correct 1443 ms 88072 KB Output is correct
55 Correct 1469 ms 87800 KB Output is correct
56 Correct 388 ms 2036 KB Output is correct
57 Correct 564 ms 2420 KB Output is correct
58 Correct 858 ms 2932 KB Output is correct
59 Correct 2197 ms 84088 KB Output is correct
60 Correct 2488 ms 84084 KB Output is correct
61 Correct 2037 ms 84088 KB Output is correct
62 Correct 1759 ms 85752 KB Output is correct
63 Correct 2257 ms 85124 KB Output is correct
64 Correct 2153 ms 84344 KB Output is correct
65 Correct 1971 ms 83956 KB Output is correct
66 Correct 2256 ms 84344 KB Output is correct
67 Correct 2134 ms 87160 KB Output is correct
68 Correct 1848 ms 98292 KB Output is correct
69 Correct 2315 ms 107500 KB Output is correct