結果

問題 No.1266 7 Colors
ユーザー packer_jppacker_jp
提出日時 2020-10-23 22:40:03
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 363 ms / 3,000 ms
コード長 5,011 bytes
コンパイル時間 2,414 ms
コンパイル使用メモリ 211,872 KB
実行使用メモリ 25,528 KB
最終ジャッジ日時 2023-09-28 16:49:59
合計ジャッジ時間 10,027 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 268 ms
9,640 KB
testcase_04 AC 347 ms
19,700 KB
testcase_05 AC 280 ms
10,836 KB
testcase_06 AC 353 ms
21,380 KB
testcase_07 AC 357 ms
23,852 KB
testcase_08 AC 349 ms
20,332 KB
testcase_09 AC 324 ms
16,800 KB
testcase_10 AC 325 ms
15,392 KB
testcase_11 AC 287 ms
11,764 KB
testcase_12 AC 296 ms
12,816 KB
testcase_13 AC 307 ms
14,032 KB
testcase_14 AC 266 ms
10,276 KB
testcase_15 AC 363 ms
24,016 KB
testcase_16 AC 298 ms
13,412 KB
testcase_17 AC 358 ms
23,112 KB
testcase_18 AC 274 ms
25,528 KB
testcase_19 AC 163 ms
24,696 KB
testcase_20 AC 165 ms
24,684 KB
testcase_21 AC 229 ms
6,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr << #a " = " << (a) << endl
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int sign(int a) { return (a > 0) - (a < 0); }
int cdiv(int a, int b) { return (a - 1 + b) / b; }
template<typename T> void fin(T a) {
    cout << a << endl;
    exit(0);
}
template<typename T> T sq(T a) { return a * a; }
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
    os << "(" << a.first << ", " << a.second << ")";
    return os;
}
template<typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {
    os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

template<typename S>
struct union_find_tree {
    using T = typename S::T;
    std::vector<int> par, sz;
    std::vector<T> val;
    union_find_tree(const std::vector<T> &val) : par(val.size(), -1), sz(val.size(), 1), val(val) {}
    union_find_tree(int n, const T &x = {}) : union_find_tree(std::vector<T>(n, x)) {}
    int root(int i) {
        if (par[i] == -1) { return i; }
        else { return par[i] = root(par[i]); }
    }
    void unite(int i, int j) {
        if ((i = root(i)) == (j = root(j))) { return; }
        if (sz[i] < sz[j]) { std::swap(i, j); }
        sz[i] += sz[j];
        val[i] = S::op(val[i], val[j]);
        par[j] = i;
    }
    bool same(int i, int j) { return root(i) == root(j); }
    int size(int i) { return sz[root(i)]; }
    T &operator[](int i) { return val[root(i)]; }
};

struct normal_uf {
    struct T {};
    static T op(const T &a, const T &b) { return {}; }
};

signed main() {
    int N, M, Q;
    cin >> N >> M >> Q;
    vector<string> s(N);
    union_find_tree<normal_uf> uf(7 * N);
    rep(i, N) {
        cin >> s[i];
        rep(j, 7) {
            if (s[i][j] == '1' && s[i][(j + 1) % 7] == '1') {
                uf.unite(i * 7 + j, i * 7 + (j + 1) % 7);
            }
        }
    }
    vint u(M), v(M);
    vector adj(N, vint());
    rep(i, M) {
        cin >> u[i] >> v[i], u[i]--, v[i]--;
        adj[u[i]].emplace_back(v[i]);
        adj[v[i]].emplace_back(u[i]);
        rep(j, 7) {
            if (s[u[i]][j] == '1' && s[v[i]][j] == '1') { uf.unite(u[i] * 7 + j, v[i] * 7 + j); }
        }
    }
    while (Q--) {
        int q, x, y;
        cin >> q >> x >> y, x--, y--;
        if (q == 1) {
            s[x][y] = '1';
            if (s[x][(y + 6) % 7] == '1') { uf.unite(x * 7 + y, x * 7 + (y + 6) % 7); }
            if (s[x][(y + 1) % 7] == '1') { uf.unite(x * 7 + y, x * 7 + (y + 1) % 7); }
            for (int to:adj[x]) {
                if (s[to][y] == '1') { uf.unite(x * 7 + y, to * 7 + y); }
            }
        } else {
            cout << uf.size(x * 7) << endl;
        }
    }
}
0