結果
問題 | No.1266 7 Colors |
ユーザー | daut-dlang |
提出日時 | 2020-10-23 22:51:09 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 413 ms / 3,000 ms |
コード長 | 3,351 bytes |
コンパイル時間 | 1,452 ms |
コンパイル使用メモリ | 105,888 KB |
実行使用メモリ | 49,316 KB |
最終ジャッジ日時 | 2023-09-04 10:50:46 |
合計ジャッジ時間 | 10,920 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 270 ms
23,964 KB |
testcase_04 | AC | 379 ms
36,500 KB |
testcase_05 | AC | 281 ms
24,236 KB |
testcase_06 | AC | 389 ms
35,720 KB |
testcase_07 | AC | 413 ms
37,616 KB |
testcase_08 | AC | 371 ms
37,252 KB |
testcase_09 | AC | 345 ms
32,668 KB |
testcase_10 | AC | 356 ms
33,224 KB |
testcase_11 | AC | 305 ms
24,960 KB |
testcase_12 | AC | 322 ms
30,856 KB |
testcase_13 | AC | 338 ms
32,928 KB |
testcase_14 | AC | 294 ms
24,544 KB |
testcase_15 | AC | 401 ms
44,240 KB |
testcase_16 | AC | 315 ms
30,384 KB |
testcase_17 | AC | 385 ms
37,816 KB |
testcase_18 | AC | 286 ms
33,860 KB |
testcase_19 | AC | 269 ms
49,124 KB |
testcase_20 | AC | 272 ms
49,316 KB |
testcase_21 | AC | 170 ms
13,364 KB |
ソースコード
import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } long mod = 10^^9 + 7; //long mod = 998_244_353; //long mod = 1_000_003; void moda(T)(ref T x, T y) { x = (x + y) % mod; } void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; } void modm(T)(ref T x, T y) { x = (x * y) % mod; } void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); } struct UnionFind(T) { void init(T n) { par = new T[](n); foreach (i; 0..n) par[i] = i; cnt = new T[](n); fill(cnt, 1); } T root(T i) { return par[i] == i ? i : (par[i] = root(par[i])); } bool same(T i, T j) { return root(i) == root(j); } void unite(T i, T j) { i = root(i); j = root(j); if (i == j) return; par[i] = j; cnt[j] += cnt[i]; } T size(T i) { return cnt[root(i)]; } T[] par, cnt; } void main() { auto N = RD; auto M = RD; auto Q = RD; auto s = new char[][](N); foreach (i; 0..N) s[i] = RD!(char[]); UnionFind!long uf; uf.init(N*7); foreach (i; 0..N) { foreach (j; 0..7) { if (s[i][j] == '0') continue; auto k = (j+7-1) % 7; if (s[i][j] == s[i][k]) uf.unite(i+j*N, i+k*N); } } auto edges = new long[][](N); foreach (i; 0..M) { auto u = RD-1; auto v = RD-1; edges[u] ~= v; edges[v] ~= u; foreach (j; 0..7) { if (s[u][j] == '1' && s[v][j] == '1') { uf.unite(u+j*N, v+j*N); } } } foreach (i; 0..Q) { auto num = RD; auto x = RD-1; auto y = RD-1; if (num == 1) { s[x][y] = '1'; auto l = (y+7-1) % 7; auto r = (y+7+1) % 7; if (s[x][l] == '1') uf.unite(x+l*N, x+y*N); if (s[x][r] == '1') uf.unite(x+r*N, x+y*N); foreach (v; edges[x]) { if (s[v][y] == '1') { uf.unite(x+y*N, v+y*N); } } } else if (num == 2) { debug { long[] cnt; foreach (j; 0..N) cnt ~= uf.size(j); writeln("cnt:", cnt); } writeln(uf.size(x)); } } stdout.flush; debug readln; }