제출 #817448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
817448		MohamedAhmed04	Inside information (BOI21_servers)	C++14	0 / 100	47 ms	33808 KiB

servers

#include <bits/stdc++.h>

using namespace std ;

const int MAX = 4000 + 10 ;

int n , q ;

vector< vector<int> >adj(MAX) ;
vector<int>v[MAX] ;

int cnt[MAX] , mark[MAX][MAX] ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>q ;
	for(int i = 1 ; i <= n ; ++i)
		v[i] = {i} , cnt[i] = 1 , mark[i][i] = 1 ;
	for(int i = 0 ; i < n+q-1 ; ++i)
	{
		char c ;
		cin>>c ;
		if(c == 'S')
		{
			int x , y ;
			cin>>x>>y ;
			assert(v[x].size() == 1 || v[y].size() == 1) ;
			vector<int>v2 = v[x] ;
			for(auto &j : v[y])
				v[x].push_back(j) , mark[x][j] = 1 , cnt[j]++ ;
			for(auto &j : v2)
				v[y].push_back(j) , mark[y][j] = 1 , cnt[j]++ ;

		}
		else if(c == 'Q')
		{
			int x , y ;
			cin>>x>>y ;
			if(mark[x][y])
				cout<<"yes\n" ;
			else
				cout<<"no\n" ;
		}
		else if(c == 'C')
		{
			int x ;
			cin>>x ;
			cout<<cnt[x]<<"\n" ;
		}
	}
	return 0 ;
}

• Subtask 1: 0 / 2.5
• Subtask 2: 0 / 2.5
• Subtask 3: 0 / 2.5
• Subtask 4: 0 / 2.5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 12.5
• Subtask 10: 0 / 12.5
• Subtask 11: 0 / 17.5
• Subtask 12: 0 / 17.5