제출 #787726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
787726		drkarlicio2107	Inside information (BOI21_servers)	C++14	5 / 100	305 ms	524288 KiB

servers

#include <bits/stdc++.h>
using namespace std;
int l [5000][5000];
int sz [120010];
bitset <120010> bi [120010];
int main(){
	int n, k; cin >> n >> k;
	if (n<=4000){
		for (int i=1; i<n+1; i++){
			l [i][i]=1; sz [i]=1;
		}
		for (int i=0; i<n+k-1; i++){
			char q; cin >> q;
			if (q=='S'){
				int a, b; cin >> a >> b;
				for (int j=1; j<n+1; j++){
					if (l [a][j]+l [b][j]==1) sz [j]++;
					l [a][j]=l [b][j]=max (l [a][j], l [b][j]);
				}
			}
			else if (q=='Q'){
				int a, b; cin >> a >> b;
				if (l [a][b]==1) cout << "yes" << endl;
				else cout << "no" << endl;
			}
			else {
				int d; cin >> d;
				cout << sz [d] << endl;
			}
		}
	}
	else {
		for (int i=1; i<n+1; i++){
			bi [i][i]=1; sz [i]=1;
		}
		for (int i=0; i<n+k-1; i++){
			char q; cin >> q;
			if (q=='S'){
				int a, b; cin >> a >> b;
				bi [a]|=bi [b];
				bi [b]|=bi [a];
			}
			else if (q=='Q'){
				int a, b; cin >> a >> b;
				if (bi [a][b]==1) cout << "yes" << endl;
				else cout << "no" << endl;
			}
		}
	}
	return 0;
}

• Subtask 1: 2.5 / 2.5
• Subtask 2: 2.5 / 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