Submission #899121

#	Time	Username	Problem	Language	Result	Execution time	Memory
899121		AIF_is_carving	Inside information (BOI21_servers)	C++17	5 / 100	1714 ms	377764 KiB

servers

#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

const int N=1e4+5;
set<int> graph[N];
int cnt[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);


 
    int n, k; cin>>n>>k;

    for(int i=1; i<=n; i++){
        graph[i].insert(i);
        cnt[i]=1;
    }

    for(int i=0; i<n+k-1; i++){
        char c; cin>>c;
        if(c=='S'){
            int u, v; cin>>u>>v;
            for(auto x: graph[v]){
                if(graph[u].find(x)==graph[u].end()){ 
                    cnt[x]+=1;
                    graph[u].insert(x);
                }
            }
            for(auto x: graph[u]){
                if(graph[v].find(x)==graph[v].end()){ 
                    cnt[x]+=1;
                    graph[v].insert(x);
                }
            }
        }
        else if(c=='Q'){
            int v, chunk ; cin>>v>>chunk;
            if(graph[v].find(chunk)==graph[v].end()){
                cout<<"no"<<"\n";
            }
            else{
                cout<<"yes"<<"\n";
            }  
        }
        else{
            int v; cin>>v;
            cout<<cnt[v]<<"\n";
        }
    }

    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