結果
| 問題 | No.1266 7 Colors |
| ユーザー |
 heno239
|
| 提出日時 | 2020-10-23 22:08:43 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 222 ms / 3,000 ms |
| コード長 | 4,391 bytes |
| コンパイル時間 | 1,495 ms |
| コンパイル使用メモリ | 126,016 KB |
| 実行使用メモリ | 28,392 KB |
| 最終ジャッジ日時 | 2024-07-21 10:39:38 |
| 合計ジャッジ時間 | 5,899 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 19 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acosl(-1.0);ll mod_pow(ll x, ll n, ll m = mod) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 18;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}struct uf {private:vector<int> par, ran,cnt;public:uf(int n) {par.resize(n, 0);ran.resize(n, 0);cnt.resize(n, 1);rep(i, n) {par[i] = i;}}int find(int x) {if (par[x] == x)return x;else return par[x] = find(par[x]);}void unite(int x, int y) {x = find(x), y = find(y);if (x == y)return;if (ran[x] < ran[y]) {par[x] = y; cnt[y] += cnt[x];}else {par[y] = x; cnt[x] += cnt[y];if (ran[x] == ran[y])ran[x]++;}}bool same(int x, int y) {return find(x) == find(y);}int takecnt(int x) {return cnt[find(x)];}};void solve() {int n, m, q; cin >> n >> m >> q;vector<vector<bool>> b(n, vector<bool>(7));rep(i, n) {string s; cin >> s;rep(j, 7)b[i][j] = (s[j] == '1');}vector<vector<int>> G(n);rep(i, m) {int a, b; cin >> a >> b; a--; b--;G[a].push_back(b);G[b].push_back(a);}uf u(7 * n);rep(i, n) {rep(j, 7) {int to = (j + 1) % 7;if (b[i][j] && b[i][to]) {u.unite(i + n * j, i + n * to);}}for (int to : G[i]) {rep(j, 7) {if (b[i][j] && b[to][j]) {u.unite(i + n * j, to + n * j);}}}}rep(i, q) {int t; cin >> t;if (t == 1) {int x, y; cin >> x >> y; x--; y--; b[x][y] = true;int to = y - 1; if (to < 0)to += 7;if (b[x][to]) {u.unite(x + n * to, x + n * y);}to = (y + 1); if (to >= 7)to -= 7;if (b[x][to]) {u.unite(x + n * to, x + n * y);}for (int to : G[x]) {if (b[to][y]) {u.unite(x + n * y, to + n * y);}}}else {int x; cin >> x; x--; int gomi; cin >> gomi;int ans = u.takecnt(x);cout << ans << "\n";}}}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f();//init();//expr();//int t; cin >> t; rep(i, t)solve();return 0;}