제출 #969575

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

servers

//author : FatihCihan
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
const int N = 120005;
const int inf = 1e9 + 7;
int vis[N] , ttime = 1;
vector < pair < int , int > > graph[N];
void dfs1(int node , int mn){
	if(vis[node])return;
	// cout << "dfs1 : " << node << " , " << mn << endl;
	// cout << "graph : ";for(auto itr : graph[node])cout << itr.first << "," << itr.second << "   ";cout << endl;
	vis[node] = 1;
	for(auto itr : graph[node]){
		if(itr.second > mn){
			dfs1(itr.first , itr.second);
		}
	}
}
void solve(){
	int n,k;
	cin >> n >> k;
	int q_no = n + k - 1;
	while(q_no--){
		char ch;
		cin >> ch;
		if(ch == 'S'){
			int a,b;
			cin >> a >> b;
			graph[a].push_back({b , ttime});
			graph[b].push_back({a , ttime});
			ttime++;
		}
		else if(ch == 'Q'){
			int a,d;
			cin >> a >> d;
			fill(vis , vis + n + 1 , 0);
			dfs1(d , -inf);
			cout << (vis[a] ? "yes" : "no") << '\n';
		}
		else{
			int d;
			cin >> d;
			fill(vis , vis + n + 1 , 0);
			dfs1(d , -inf);
			cout << count(vis , vis + n + 1 , 1) << '\n';
		}
	}
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int testcase = 1;//cin >> testcase;
	while(testcase--)solve();
	cerr << 1000.0 * clock() / CLOCKS_PER_SEC << " ms" << endl;
}

• 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