結果

問題 No.1565 Union
ユーザー ゆにぽけゆにぽけ
提出日時 2023-10-18 12:08:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 126 ms / 2,000 ms
コード長 3,734 bytes
コンパイル時間 1,414 ms
コンパイル使用メモリ 136,360 KB
実行使用メモリ 16,896 KB
最終ジャッジ日時 2024-09-18 08:30:16
合計ジャッジ時間 5,419 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
9,592 KB
testcase_01 AC 5 ms
9,608 KB
testcase_02 AC 5 ms
9,580 KB
testcase_03 AC 5 ms
9,452 KB
testcase_04 AC 5 ms
9,460 KB
testcase_05 AC 4 ms
9,836 KB
testcase_06 AC 4 ms
10,044 KB
testcase_07 AC 5 ms
9,608 KB
testcase_08 AC 4 ms
9,572 KB
testcase_09 AC 6 ms
9,680 KB
testcase_10 AC 29 ms
11,356 KB
testcase_11 AC 65 ms
14,052 KB
testcase_12 AC 58 ms
12,592 KB
testcase_13 AC 21 ms
11,148 KB
testcase_14 AC 76 ms
13,944 KB
testcase_15 AC 119 ms
15,960 KB
testcase_16 AC 108 ms
16,028 KB
testcase_17 AC 121 ms
16,160 KB
testcase_18 AC 126 ms
16,168 KB
testcase_19 AC 124 ms
16,232 KB
testcase_20 AC 62 ms
16,612 KB
testcase_21 AC 62 ms
16,548 KB
testcase_22 AC 62 ms
16,572 KB
testcase_23 AC 63 ms
16,596 KB
testcase_24 AC 63 ms
16,728 KB
testcase_25 AC 64 ms
16,544 KB
testcase_26 AC 62 ms
16,896 KB
testcase_27 AC 63 ms
16,672 KB
testcase_28 AC 63 ms
16,584 KB
testcase_29 AC 62 ms
16,500 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
//using mint = modint<998244353>;
using mint = modint<1000000007>;

template<class S>
struct combination
{
	vector<S> f,invf;

	combination(int N = 0) : f(1,1),invf(1,1)
	{
		update(N);
	}

	void update(int N)
	{
		if((int)f.size() > N) return;
		int pi = (int)f.size();
		N = max(N,pi*2);

		f.resize(N+1),invf.resize(N+1);

		for(int i = pi;i <= N;i++) f[i] = f[i-1]*i;
		invf[N] = S(1)/f[N];
		for(int i = N-1;i >= pi;i--) invf[i] = invf[i+1]*(i+1);
	}

	S factorial(int N)
	{
		update(N);
		return f[N];
	}

	S invfactorial(int N)
	{
		update(N);
		return invf[N];
	}

	S P(int N,int K)
	{
		assert(0 <= K && K <= N);
		update(N);
		return f[N]*invf[N-K];
	}

	S C(int N,int K)
	{
		assert(0 <= K && K <= N);
		update(N);
		return f[N]*invf[K]*invf[N-K];
	}

	S H(int N,int K)
	{
		if(!N) return K == 0 ? 1:0;
		return C(N+K-1,K);
	}
};
combination<mint> C;
int N,M,dp[2 << 17];
vector<int> G[2 << 17];
void solve()
{
	cin >> N >> M;
	for(int i = 0;i < M;i++)
	{
		int u,v;
		cin >> u >> v;
		u--; v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	for(int i = 0;i < N;i++) dp[i] = -1;
	dp[0] = 0;
	queue<int> Q;
	Q.push(0);
	while(!Q.empty())
	{
		int u = Q.front();
		Q.pop();
		for(int v:G[u]) if(dp[v] < 0) dp[v] = dp[u] + 1,Q.push(v);
	}
	cout << dp[N-1] << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}
0