結果

問題 No.1983 [Cherry 4th Tune C] 南の島のマーメイド
ユーザー xyz2606xyz2606
提出日時 2022-06-17 22:15:13
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 140 ms / 4,000 ms
コード長 5,353 bytes
コンパイル時間 2,336 ms
コンパイル使用メモリ 151,360 KB
実行使用メモリ 15,676 KB
最終ジャッジ日時 2024-10-09 08:18:05
合計ジャッジ時間 8,170 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 4 ms
5,248 KB
testcase_09 AC 5 ms
5,248 KB
testcase_10 AC 7 ms
5,248 KB
testcase_11 AC 7 ms
5,248 KB
testcase_12 AC 5 ms
5,248 KB
testcase_13 AC 73 ms
7,508 KB
testcase_14 AC 88 ms
8,692 KB
testcase_15 AC 87 ms
8,832 KB
testcase_16 AC 43 ms
6,912 KB
testcase_17 AC 92 ms
9,148 KB
testcase_18 AC 74 ms
8,832 KB
testcase_19 AC 98 ms
10,880 KB
testcase_20 AC 74 ms
8,448 KB
testcase_21 AC 86 ms
9,216 KB
testcase_22 AC 104 ms
11,052 KB
testcase_23 AC 140 ms
12,024 KB
testcase_24 AC 136 ms
12,308 KB
testcase_25 AC 139 ms
12,032 KB
testcase_26 AC 139 ms
12,160 KB
testcase_27 AC 136 ms
12,152 KB
testcase_28 AC 140 ms
12,152 KB
testcase_29 AC 137 ms
12,024 KB
testcase_30 AC 139 ms
12,036 KB
testcase_31 AC 137 ms
12,144 KB
testcase_32 AC 140 ms
12,180 KB
testcase_33 AC 2 ms
5,248 KB
testcase_34 AC 54 ms
5,888 KB
testcase_35 AC 104 ms
15,676 KB
testcase_36 AC 99 ms
11,264 KB
testcase_37 AC 2 ms
5,248 KB
testcase_38 AC 38 ms
5,248 KB
testcase_39 AC 106 ms
15,676 KB
testcase_40 AC 101 ms
11,264 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<chrono>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
#include<type_traits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(chrono::system_clock::now().time_since_epoch().count());
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
    const int maxn = 131072;
    static char buf[maxn],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
    int res(0);
    char c = getchar();
    while(c < '0') c = getchar();
    while(c >= '0') {
        res = res * 10 + (c - '0');
        c = getchar();
    }
    return res;
}
inline LL fastpo(LL x, LL n, LL mod) {
    LL res(1);
    while(n) {
        if(n & 1) {
            res = res * (LL)x % mod;
        }
        x = x * (LL) x % mod;
        n /= 2;
    }
    return res;
}
template<LL mod> struct Num {
	LL a;
	Num operator + (const Num & b) { return Num{(a + b.a) % mod}; }
	Num operator - (const Num & b) { return Num{(a - b.a + mod) % mod}; }
	Num operator * (const Num & b) { return Num{a * b.a % mod}; }
	Num operator / (const Num & b) { return Num{a * fastpo(b.a, mod - 2, mod) % mod}; }
	void operator += (const Num & b) {if((a += b.a) >= mod) a -= mod;}
	void operator -= (const Num & b) {if((a -= b.a) < 0) a += mod;}
	void operator *= (const Num & b) { a = a * b.a % mod; }
	void operator /= (const Num & b) { a = a * fastpo(b.a, mod - 2, mod) % mod; }
	void operator = (const Num & b) { a = b.a; }
	void operator = (const LL & b) { a = b; }
};
template<LL mod> ostream & operator << (ostream & os, const Num<mod> & a) {
	os << a.a;
	return os;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }

inline string itoa(LL x, int width = 0) {
	string res;
	if(x == 0) res.push_back('0');
	while(x) {
		res.push_back('0' + x % 10);
		x /= 10;
	}
	while((int)res.size() < width) res.push_back('0');
	reverse(res.begin(), res.end());
	return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
	fwrite(buf, 1, _bl, stdout);
	_bl = 0;
}
__inline void _putchar(char c) {
	if(_bl == _B) flush();
	buf[_bl++] = c;
}
inline void print(LL x, char c) {
	static char tmp[20];
	int l = 0;
	if(!x) tmp[l++] = '0';
	else {
		while(x) {
			tmp[l++] = x % 10 + '0';
			x /= 10;
		}
	}
	for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
	_putchar(c);
}
typedef double C;
struct P {
	C x, y;
	void scan() {
		double _x, _y;
		scanf("%lf%lf", &_x, &_y);
		x = _x; y = _y;
	}
	void print() {
		cout << '(' << x << ' ' << y << ')' << endl;
	}
	P operator + (const P & b) const { return P{x + b.x, y + b.y}; }
	P operator - (const P & b) const { return P{x - b.x, y - b.y}; }
	C operator * (const P & b) const { return x * b.y - y * b.x; }
	C operator % (const P & b) const { return x * b.x + y * b.y; }
};
P operator * (const C & x, const P & b) { return P{x * b.x, x * b.y}; }
const int N = 300033;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int rela[N];
int getr(int x) {
    int p = x;
    while(rela[p] != p) p = rela[p];
    int p1 = p; p = x;
    while(rela[p] != p) {
        int p2 = rela[p];
        rela[p] = p1;
        p = p2;
    }
    return p1;
}
int vst[N], blg[N];
struct E {
	int y, next, banned;
} e[N * 2];
int idx[N], stmp[N];
int l;
void build(int x, int y) {
	e[++l].y = y;
	e[l].next = idx[x];
	idx[x] = l;
}
int main() {
	int n, m, Q;
	scanf("%d%d%d", &n, &m, &Q);
	l = 1;
	for(int i = 1; i  <= m; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		build(x, y);
		build(y, x);
	}
	vector<pair<int, int> > st;
	vector<int> s1, s2;
	int np = 0, tim = 0;
	auto push = [&](int v) {
		st.pb({v, idx[v]});
		s1.pb(v); s2.pb(v); stmp[v] = ++tim;
	};
	for(int i = 1; i <= n; i++) {
		if(blg[i]) continue;
		push(i);
		while(!st.empty()) {
			int v = st.back().fi, p = st.back().se;
			st.back().se = e[p].next;
			if(p) {
				if(e[p].banned) {
				}else {
					e[p ^ 1].banned = true;
					int y = e[p].y;
					if(blg[y]) {
					}else {
						if(stmp[y]) {
							while(!s2.empty() && stmp[s2.back()] > stmp[y]) s2.pop_back();
						}else {
							push(y);
						}
					}
				}
			}else {
				if(s2.back() == v) {
					np++;
					while(s1.back() != v) {
						blg[s1.back()] = np;
						s1.pop_back();
					}
					blg[v] = np;
					s1.pop_back();
					s2.pop_back();
				}
				st.pop_back();
			}
		}
	}
	for(int i = 1; i <= n; i++) {
		rela[i] = i;
		//printf("blg[%d] = %d\n", i, blg[i]);
	}
	for(int i = 1; i <= n; i++) {
		for(int p = idx[i]; p; p = e[p].next) {
			if(blg[e[p].y] != blg[i]) {
				rela[getr(e[p].y)] = getr(i);
			}
		}
	}
	for(int i = 1; i <= Q; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		printf("%s\n", getr(x) == getr(y) ? "Yes" : "No");
	}
}
0