제출 #550520

#제출 시각아이디문제언어결과실행 시간메모리
550520LittleCubeInside information (BOI21_servers)C++14
5 / 100
547 ms4468 KiB
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N, K, c[4005];
bitset<4005> b[4005];


signed main()
{
	cin >> N >> K;
	K += N - 1;
	for(int i = 1; i <= N; i++)
		b[i][i] = 1;
	for(int i = 1; i <= K; i++)
	{
		char t;
	   	int	A, B;
		cin >> t;
		if(t == 'C')
			cin >> A;
		else
			cin >> A >> B;
		
		if(t == 'S')
		{
			b[A] |= b[B];
			b[B] |= b[A];
		}
		else if(t == 'C')
		{
			int cnt = 0;
			for(int i = 1; i <= N; i++)
				cnt += b[i][A];	
			cout << cnt << '\n';
		}
		else if(t == 'Q')
			cout << (b[A][B] ? "yes\n" : "no\n");

	}	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...