제출 #1183927

#제출 시각아이디문제언어결과실행 시간메모리
1183927tamyteInside information (BOI21_servers)C++20
5 / 100
283 ms589824 KiB
#include <bits/stdc++.h>

using namespace std;


int main() {
	int n, k;
	cin >> n >> k;
	vector<vector<int>> data(n, vector<int>(n));
	for (int i = 0; i < n; ++i) {
		data[i][i] = 1;
	}
	vector<int> cnt(n, 1);
	for (int i = 0; i < n + k - 1; ++i) {
		char c;
		cin >> c;
		if (c == 'S') {
			int a, b;
			cin >> a >> b;
			--a; --b;
			for (int j = 0; j < n; ++j) {
				if (data[a][j] && !data[b][j]) {
					cnt[j]++;
					data[b][j] = 1;
				}
				if (!data[a][j] && data[b][j]) {
					cnt[j]++;
					data[a][j] = 1;
				}
			}
		} else if (c == 'Q') {
			int a, b;
			cin >> a >> b;
			--a; --b;
			cout << (data[a][b] ? "yes\n" : "no\n");
		} else {
			int a;
			cin >> a;
			--a;
			cout << cnt[a] << "\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...