#636692 (C++14) No.1451 集団登校

• 問題: No.1451 集団登校
• ユーザー: kotatsugame
• 提出日時: 2021-03-31 15:34:53
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 165 ms / 2,000 ms
• コード長: 3,209 bytes
• コンパイル時間: 904 ms
• コンパイル使用メモリ: 76,124 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-08 18:16:02
• 合計ジャッジ時間: 4,470 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	128 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	137 ms; 5,376 KB
testcase_11	AC	128 ms; 5,376 KB
testcase_12	AC	125 ms; 5,376 KB
testcase_13	AC	160 ms; 5,376 KB
testcase_14	AC	161 ms; 5,376 KB
testcase_15	AC	90 ms; 5,376 KB
testcase_16	AC	142 ms; 5,376 KB
testcase_17	AC	52 ms; 5,376 KB
testcase_18	AC	58 ms; 5,376 KB
testcase_19	AC	78 ms; 5,376 KB
testcase_20	AC	165 ms; 5,376 KB
testcase_21	AC	31 ms; 5,376 KB
testcase_22	AC	30 ms; 5,376 KB
testcase_23	AC	9 ms; 5,376 KB
testcase_24	AC	131 ms; 5,376 KB
testcase_25	AC	85 ms; 5,376 KB
testcase_26	AC	139 ms; 5,376 KB
testcase_27	AC	102 ms; 5,376 KB
testcase_28	AC	41 ms; 5,376 KB
testcase_29	AC	85 ms; 5,376 KB

コンパイルメッセージ

a.cpp:9:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]

ソースコード

#line 1 "a.cpp"
#include<iostream>
#include<vector>
using namespace std;
#line 2 "/home/kotatsugame/library/datastructure/UF.cpp"
struct UF{
	int n;
	vector<int>parent,rank;
	UF(int n_=0):n(n_),parent(n_),rank(n_,1)
	{
		for(int i=0;i<n_;i++)parent[i]=i;
	}
	int find(int a){return parent[a]!=a?parent[a]=find(parent[a]):a;}
	bool same(int a,int b){return find(a)==find(b);}
	bool unite(int a,int b)
	{
		a=find(a),b=find(b);
		if(a==b)return false;
		if(rank[a]<rank[b])
		{
			parent[a]=b;
			rank[b]+=rank[a];
		}
		else
		{
			parent[b]=a;
			rank[a]+=rank[b];
		}
		return true;
	}
	int size(int a){return rank[find(a)];}
};
#line 3 "/home/kotatsugame/library/math/modint.cpp"
#include<utility>
template<int m>
struct modint{
	unsigned int x;
	constexpr modint()noexcept:x(){}
	template<typename T>
	constexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}
	constexpr unsigned int val()const noexcept{return x;}
	constexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}
	constexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}
	constexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}
	constexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}
	constexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}
	constexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}
	constexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}
	constexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}
	constexpr modint operator+()const noexcept{return*this;}
	constexpr modint operator-()const noexcept{return modint()-*this;}
	constexpr modint pow(long long n)const noexcept
	{
		if(n<0)return pow(-n).inv();
		modint x=*this,r=1;
		for(;n;x*=x,n>>=1)if(n&1)r*=x;
		return r;
	}
	constexpr modint inv()const noexcept
	{
		int s=x,t=m,x=1,u=0;
		while(t)
		{
			int k=s/t;
			s-=k*t;
			swap(s,t);
			x-=k*u;
			swap(x,u);
		}
		return modint(x);
	}
	friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}
	friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}
	friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}
	friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}
	friend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}
	friend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}
	friend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}
	friend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}
};
#line 6 "a.cpp"
using mint=modint<(int)1e9+7>;
int N,M;
mint ans[1<<17];
main()
{
	cin>>N>>M;
	vector<pair<int,int> >E;
	UF uf(N);
	for(int i=0;i<M;i++)
	{
		int a,b;cin>>a>>b;
		a--,b--;
		a=uf.find(a);
		b=uf.find(b);
		int asz=uf.size(a),bsz=uf.size(b);
		if(uf.unite(a,b)&&asz==bsz)E.push_back(make_pair(a,b));
	}
	for(int i=0;i<N;i++)if(uf.find(i)==i)ans[i]=1;
	for(int i=E.size();i--;)
	{
		int a=E[i].first,b=E[i].second;
		mint T=ans[a]+ans[b];
		ans[a]=ans[b]=T/2;
	}
	for(int i=0;i<N;i++)cout<<ans[i]<<endl;
}