제출 #557938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
557938		AdamGS	Inside information (BOI21_servers)	C++17	5 / 100	3581 ms	10652 KiB

servers

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=12e4+7;
vector<pair<int,int>>V[LIM];
vector<int>T;
void DFS(int x, int o, int lst) {
	T.pb(x);
	for(auto i : V[x]) if(i.st!=o && i.nd>lst) DFS(i.st, x, i.nd);
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, k, ile=0;
	cin >> n >> k;
	rep(i, n+k-1) {
		T.clear();
		char c;
		cin >> c;
		if(c=='S') {
			int a, b;
			cin >> a >> b; --a; --b;
			++ile;
			V[a].pb({b, ile});
			V[b].pb({a, ile});
		} else if(c=='Q') {
			int a, b;
			cin >> a >> b; --a; --b;
			DFS(b, b, 0);
			bool ans=false;
			for(auto j : T) if(j==a) ans=true;
			cout << (ans?"yes":"no") << '\n';
		} else {
			int a;
			cin >> a; --a;
			DFS(a, a, 0);
			cout << T.size() << '\n';
		}
	}
}

• 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