#570976 (C++17) No.1266 7 Colors

• 問題: No.1266 7 Colors
• ユーザー: marroncastle
• 提出日時: 2020-10-24 00:52:11
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 172 ms / 3,000 ms
• コード長: 2,852 bytes
• コンパイル時間: 2,632 ms
• コンパイル使用メモリ: 202,120 KB
• 最終ジャッジ日時: 2025-01-15 14:48:02
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 19

ソースコード

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
// g++ A.cpp -std=c++14 -I . && ./a.out
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < (int)(b); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll INF = 1e18;
// 変数定義
int N, M, Q, a, b, c, d, e, x, y, t, T, total, cnt, ans;
struct dsu
{
public:
  dsu() : _n(0) {}
  dsu(int n) : _n(n), parent_or_size(n, -1) {}
  int merge(int a, int b)
  {
    assert(0 <= a && a < _n);
    assert(0 <= b && b < _n);
    int x = leader(a), y = leader(b);
    if (x == y)
      return x;
    if (-parent_or_size[x] < -parent_or_size[y])
      swap(x, y);
    parent_or_size[x] += parent_or_size[y];
    parent_or_size[y] = x;
    return x;
  }
  bool same(int a, int b)
  {
    assert(0 <= a && a < _n);
    assert(0 <= b && b < _n);
    return leader(a) == leader(b);
  }
  int leader(int a)
  {
    assert(0 <= a && a < _n);
    if (parent_or_size[a] < 0)
      return a;
    return parent_or_size[a] = leader(parent_or_size[a]);
  }
  int size(int a)
  {
    assert(0 <= a && a < _n);
    return -parent_or_size[leader(a)];
  }
  vector<vector<int>> groups()
  {
    vector<int> leader_buf(_n), group_size(_n);
    for (int i = 0; i < _n; i++)
    {
      leader_buf[i] = leader(i);
      group_size[leader_buf[i]]++;
    }
    vector<vector<int>> result(_n);
    for (int i = 0; i < _n; i++)
    {
      result[i].reserve(group_size[i]);
    }
    for (int i = 0; i < _n; i++)
    {
      result[leader_buf[i]].push_back(i);
    }
    result.erase(
        remove_if(result.begin(), result.end(),
                  [&](const vector<int> &v) { return v.empty(); }),
        result.end());
    return result;
  }
private:
  int _n;
  // root node: -1 * component size
  // otherwise: parent
  vector<int> parent_or_size;
};
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> N >> M >> Q;
  dsu uf(N * 7);
  vector<string> S(N);
  rep(i, N)
  {
    cin >> S[i];
    rep(j, 7)
    {
      if (S[i][j] == '1' && S[i][(j + 1) % 7] == '1')
        uf.merge(i * 7 + j, i * 7 + (j + 1) % 7);
    }
  }
  vector<vector<int>> edge(N);
  rep(i, M)
  {
    cin >> x >> y;
    x--;
    y--;
    edge[x].push_back(y);
    edge[y].push_back(x);
    rep(j, 7)
    {
      if (S[x][j] == '1' && S[y][j] == '1')
        uf.merge(x * 7 + j, y * 7 + j);
    }
  }
  rep(i, Q)
  {
    cin >> t >> a >> b;
    a--;
    b--;
    if (t == 1)
    {
      S[a][b] = '1';
      if (S[a][(b + 6) % 7] == '1')
        uf.merge(a * 7 + (b + 6) % 7, a * 7 + b);
      if (S[a][(b + 1) % 7] == '1')
        uf.merge(a * 7 + (b + 1) % 7, a * 7 + b);
      for (auto v : edge[a])
      {
        if (S[v][b] == '1')
          uf.merge(a * 7 + b, v * 7 + b);
      }
    }
    else
    {
      cout << uf.size(a * 7) << '\n';
    }
  }
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX