#636725 (D) No.1451 集団登校

• 問題: No.1451 集団登校
• ユーザー: daut-dlang
• 提出日時: 2021-03-31 15:45:10
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 3,076 bytes
• コンパイル時間: 709 ms
• コンパイル使用メモリ: 120,700 KB
• 実行使用メモリ: 20,460 KB
• 最終ジャッジ日時: 2024-06-22 11:08:06
• 合計ジャッジ時間: 4,830 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	1 ms; 6,944 KB
testcase_03	AC	1 ms; 6,940 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	AC	1 ms; 6,944 KB
testcase_08	AC	161 ms; 20,460 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	WA	-
testcase_11	AC	134 ms; 9,720 KB
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	80 ms; 6,940 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-

ソースコード

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(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long 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;
	UnionFind!long uf;
	uf.init(N);
	auto ans = new long[](N);
	ans[] = 1;
	auto list = new long[][](N);
	foreach (i; 0..N)
		list[i] ~= i;
	foreach (i; 0..M)
	{
		auto a = RD-1;
		auto b = RD-1;
		auto ra = uf.root(a);
		auto rb = uf.root(b);
		if (uf.same(ra, rb)) continue;
		long c1 = uf.size(ra);
		long c2 = uf.size(rb);
		uf.unite(ra, rb);
		if (c1 == c2)
		{
			foreach (e; list[ra])
				ans[e].modm(2);
			foreach (e; list[rb])
				ans[e].modm(2);
			auto r = uf.root(ra);
			list[r] = list[ra] ~ list[rb];
		}
		else if (c1 > c2)
		{
			foreach (e; list[rb])
				ans[e] = 0;
			list[rb].length = 0;
		}
		else
		{
			foreach (e; list[ra])
				ans[e] = 0;
			list[ra].length = 0;
		}
	}

	foreach (e; ans)
	{
		long x = 1;
		x.modd(e);
		writeln(x);
	}
	stdout.flush;
	debug readln;
}