結果

問題 No.1266 7 Colors
ユーザー Enjapma_kyopro
提出日時 2020-10-23 22:20:44
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 252 ms / 3,000 ms
コード長 4,891 bytes
コンパイル時間 997 ms
コンパイル使用メモリ 87,576 KB
実行使用メモリ 36,844 KB
最終ジャッジ日時 2024-07-21 10:59:10
合計ジャッジ時間 6,638 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <unistd.h>
#include <stdlib.h>
#include <cassert>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 1e18;
const ll fact_table = 3200008;
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop
ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←
/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)
#define rep2(i, a, b) for (ll i = a; i <= (b); i++)
#define rep3(i, a, b) for (ll i = b; i >= (a); i--)
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
// const ll mod = 998244353ll;
const ll mod = 1000000007ll;
ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;}
vec readvec(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}
/*
ll fact[fact_table + 5], rfact[fact_table + 5];
void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/
bool icpc = false;
bool multicase = false;
ll n, m, q;
bool table[200005][8];
string s[200005];
ll parent[800005], sizes[800005];
vec G[500005];
void init(ll n){
    for(ll i=0;i<=n;i++){
        parent[i] = i;
        sizes[i] = 1;
    }
}
ll find(ll x){
    if(parent[x] == x){
        return x;
    }else{
        return parent[x] = find(parent[x]);
    }
}
void unite(ll x,ll y){
    x = find(x);
    y = find(y);
    if(x == y)return;
    if(sizes[x] < sizes[y])swap(x, y);
    parent[y] = x;
    sizes[x] += sizes[y];
}
bool same(ll x,ll y){
    return find(x) == find(y);
}
ll size(ll x){
    return sizes[find(x)];
}
bool solve() {
    cin >> n >> m >> q;
    init(n * 7 + 100);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
        rep (j, 7) {
            if (s[i][j] == '1') table[i][j] = true;
        }
    }
    rep (i, n) {
        rep (j, 7) {
            if (table[i][j] && table[i][(j + 1) % 7]) {
                int id1 = 7 * i + j, id2 = 7 * i + (j + 1) % 7;
                unite(id1, id2);
            }
        }
    }
    rep(i, m) {
        ll a, b;
        cin >> a >> b;
        G[a].pb(b);
        G[b].pb(a);
        rep (j, 7) {
            if (table[a - 1][j] && table[b - 1][j]) {
                int id1 = (a - 1) * 7 + j, id2 = (b - 1) * 7 + j;
                unite(id1, id2);
            }
        }
    }
    rep(i, q) {
        ll query;
        cin >> query;
        if (query == 1) {
            ll v, c;
            cin >> v >> c;
            c--;
            table[v - 1][c] = true;
            if (table[v - 1][(c + 6) % 7]) {
                int id1 = (v - 1) * 7 + c, id2 = (v - 1) * 7 + (c + 6) % 7;
                unite(id1, id2);
            }
            if (table[v - 1][(c + 1) % 7]) {
                int id1 = (v - 1) * 7 + c, id2 = (v - 1) * 7 + (c + 1) % 7;
                unite(id1, id2);
            }
            for (auto nv : G[v]) {
                if (table[v-1][c] && table[nv-1][c]) {
                    int id1 = (v - 1) * 7 + c, id2 = (nv - 1) * 7 + c;
                    unite(id1, id2);
                }
            }
        } else if (query == 2) {
            ll v, c;
            cin >> v >> c;
            ll ans = size(v * 7 - 7);
            p(ans);
        }
    }
    return true;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    if (icpc) {
        while (solve());
        return 0;
    }
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
// solve();
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0