結果

問題 No.1983 [Cherry 4th Tune C] 南の島のマーメイド
ユーザー leaf_1415leaf_1415
提出日時 2022-11-15 07:09:59
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 242 ms / 4,000 ms
コード長 11,741 bytes
コンパイル時間 1,575 ms
コンパイル使用メモリ 131,520 KB
実行使用メモリ 40,080 KB
最終ジャッジ日時 2024-09-16 08:16:08
合計ジャッジ時間 9,925 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 4 ms
5,376 KB
testcase_09 AC 5 ms
5,376 KB
testcase_10 AC 7 ms
5,376 KB
testcase_11 AC 7 ms
5,376 KB
testcase_12 AC 4 ms
5,376 KB
testcase_13 AC 90 ms
16,000 KB
testcase_14 AC 103 ms
17,020 KB
testcase_15 AC 126 ms
23,412 KB
testcase_16 AC 45 ms
15,192 KB
testcase_17 AC 107 ms
17,408 KB
testcase_18 AC 112 ms
23,588 KB
testcase_19 AC 163 ms
26,960 KB
testcase_20 AC 112 ms
22,208 KB
testcase_21 AC 120 ms
20,676 KB
testcase_22 AC 141 ms
20,736 KB
testcase_23 AC 187 ms
27,548 KB
testcase_24 AC 185 ms
27,620 KB
testcase_25 AC 224 ms
27,556 KB
testcase_26 AC 195 ms
27,664 KB
testcase_27 AC 193 ms
27,512 KB
testcase_28 AC 190 ms
27,556 KB
testcase_29 AC 242 ms
27,552 KB
testcase_30 AC 196 ms
27,564 KB
testcase_31 AC 188 ms
27,632 KB
testcase_32 AC 180 ms
27,604 KB
testcase_33 AC 2 ms
6,940 KB
testcase_34 AC 52 ms
14,056 KB
testcase_35 AC 113 ms
27,580 KB
testcase_36 AC 102 ms
20,404 KB
testcase_37 AC 2 ms
6,940 KB
testcase_38 AC 30 ms
6,940 KB
testcase_39 AC 165 ms
40,080 KB
testcase_40 AC 161 ms
34,488 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

const int mod = 1000000007;
//const int mod = 998244353;

struct mint{
	int x;
	mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
	mint(const mint &ope) {x = ope.x;}
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
	bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope = mint(t); return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

ll modpow(ll a, ll n, ll mod){
	if(n == 0) return 1;
	if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
	else return modpow((a*a)%mod, n/2, mod) % mod;
}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
template<typename T> T comb2(ll n, ll k){ if(n < 0 || k < 0 || n < k) return T(0); T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;}

vector<int> prime, pvec, qrime;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
		for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
	}
}
void make_qrime(int n){
	qrime.resize(n+1);
	rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}
void factorize(ll n, map<ll, ll> &mp){
	mp.clear();
	for(auto p : pvec) while(n % p == 0) mp[p]++, n /= p;
	if(n > 1) mp[n]++;
}

bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll arith(ll x){return x*(x+1)/2;}
ll arith(ll l, ll r){return arith(r) - arith(l-1);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
	x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
	return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}

template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}
template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);}
template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));}
template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);}

template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i,  deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}


struct BECC{
	struct edge{
		int to, id;
		edge(){}
		edge(int a, int b){to = a, id = b;}
	};
	
	int n;
	set<P> bridgeS;
	vector<vector<edge> > G;
	vector<vector<int> > compG;
	vector<int> becc;
	vector<int> pre, low;
	int order, eid, cid, beccnum;
	
	BECC(){}
	BECC(int n){this->n = n, eid = 0, G.resize(n+1);}  //V(G) = {1, 2, ..., n}, nを制約より大きくするときは注意
	
	void add_edge(int u, int v){
		eid++;
		G[u].push_back(edge(v, eid));
		G[v].push_back(edge(u, eid));
	}
	int finddfs(int v, int eid){
		pre[v] = ++order;
		int ret = pre[v];
		for(auto e : G[v]){
			int u = e.to, id = e.id;
			if(id == eid) continue;
			if(pre[u]) ret = min(ret, pre[u]);
			else ret = min(ret, finddfs(u, id));
		}
		return low[v] = ret;
	}

	void findBridge(){ //すべての橋(u, v)をu < vとなるようにbridgeSに格納する
		order = 0, bridgeS.clear();
		pre.resize(n+1), low.resize(n+1);
		for(int i = 1; i <= n; i++) pre[i] = low[i] = 0;
		
		for(int i = 1; i <= n; i++) if(!pre[i]) finddfs(i, -1);
		for(int i = 1; i <= n; i++){
			for(auto e : G[i]){
				int u = e.to;
				if(pre[i] < pre[u] && low[u] > pre[i]){
					if(i < u) bridgeS.insert(P(i, u));
					else bridgeS.insert(P(u, i));
				}
			}
		}
	}
	bool isBridge(int u, int v){ //先にfindBridge()を呼ぶべし。橋ならtrueを返す
		if(u > v) swap(u, v);
		return bridgeS.count(P(u, v));
	}
	void beccdfs(int v, int eid, int cid){
		becc[v] = cid;
		for(auto e : G[v]){
			int u = e.to, id = e.id;
			if(id == eid) continue;
			if(becc[u] || isBridge(u, v)) continue;
			beccdfs(u, id, cid);
		}
	}
	int calcBECC(){ //先にfindBridge()を呼ぶべし。戻り値はBECCの個数。BECC-IDは1-indexed
		cid = 0, becc.resize(n+1);
		for(int i = 1; i <= n; i++) becc[i] = 0;
		for(int i = 1; i <= n; i++) if(!becc[i]) beccdfs(i, -1, ++cid);
		return beccnum = cid;
	}
	void compressBECC(){ //先にcalcBECC()を呼ぶべし。圧縮後のグラフはBECC::compG
		compG.resize(beccnum+1);
		for(auto e : bridgeS){
			int u = becc[e.first], v = becc[e.second];
			compG[u].push_back(v);
			compG[v].push_back(u);
		}
	}
};

struct UnionFind{
	int size;
	vector<int> parent;
	vector<int> rank;
	vector<ll> v, e;
	
	UnionFind(){}
	UnionFind(int size){
		this->size = size;
		parent.resize(size+1);
		rank.resize(size+1);
		v.resize(size+1);
		e.resize(size+1);
		init();
	}
	void init(){
		for(int i = 0; i <= size; i++){
			parent[i] = i, rank[i] = 0;
			v[i] = 1, e[i] = 0;
		}
	}
	int root(int i){
		if(parent[i] == i) return i;
		return parent[i] = root(parent[i]);
	}
	bool same(int i, int j){
		return root(i) == root(j);
	}
	void merge(int i, int j){ // j will become new root
		parent[i] = j;
		v[j] += v[i];
		e[j] += e[i] + 1;
	}
	void unite(int i, int j){
		int root_i = root(i), root_j = root(j);
		if(root_i == root_j){
			e[root_i]++;
			return;
		}
		if(rank[root_i] < rank[root_j]) merge(root_i, root_j);
		else merge(root_j, root_i);
		if(rank[root_i] == rank[root_j]) rank[root_i]++;
	}
};

ll n, m, Q;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m >> Q;
	BECC becc(n);
	ll u, v;
	rep(i, 1, m){
		cin >> u >> v;
		becc.add_edge(u, v);
	}
	becc.findBridge();
	
	UnionFind uf(n);
	for(auto p : becc.bridgeS) uf.unite(p.fi, p.se);
	
	rep(i, 1, Q){
		cin >> u >> v;
		if(uf.same(u, v)) cout << "Yes" << "\n";
		else cout << "No" << "\n";
	}
	
	return 0;
}
0