제출 #863732

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863732		TAhmed33	Inside information (BOI21_servers)	C++98	2.50 / 100	230 ms	1364 KiB

servers

#include <bits/stdc++.h>
using namespace std;
//ana batfeshe55
const int MAXN = 120025;
int arr[MAXN]; int cnt = 0;
bool vis[MAXN];
int main () {
	int n, k;
	cin >> n >> k;	
	vis[1] = 1;
	for (int i = 1; i <= n + k - 1; i++) {
		char c;
		cin >> c;
		if (c == 'S') {
			int x, y;
			cin >> x >> y;
			if (x > y) swap(x, y);
			arr[y] = cnt++; vis[y] = 1;
		} else if (c == 'Q') {
			int x, y;
			cin >> x >> y;
			if (x == y) {
				cout << "yes\n";
				continue;
			}
			if (!vis[y] || !vis[x]) {
				cout << "no\n";
				continue;
			}
			if (x == 1 || y == 1) {
				cout << "yes\n";
				continue;
			}
			if (arr[y] < arr[x]) {
				cout << "yes\n";
			} else {
				cout << "no\n";
			}
		} else {
			int x;
			cin >> x;
			if (!vis[x]) {
				cout << 1 << '\n';
				continue;
			}
			if (x == 1) {
				cout << cnt + 1 << '\n';
				continue;
			}
			cout << arr[x] + 2 << '\n';
		}
	}
}

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