제출 #1301346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1301346		efeg	Inside information (BOI21_servers)	C++20	2 / 100	353 ms	589824 KiB

servers

#include <bits/stdc++.h>
using namespace std; 

using i64 = long long; 
template<typename T>
using vec = vector<T>; 

const int maxN = 120100; 

int n,k; 
bitset<maxN> sets[maxN]; 
int cnt[maxN];  

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); 
    cin >> n >> k; 

    for (int i = 0; i < n; i++){
        sets[i][i] = 1;
        cnt[i] = 1;  
    }

    for(int i = 0; i < n+k-1; i++){
        char tc; cin >> tc; 
        if (tc == 'S'){
            int a,b; cin >> a >> b; 
            a--; b--; 

            bitset<maxN> xorVal = sets[a] ^ sets[b]; 
            
            /*for (int i = 0; i < n; i++){
                if (xorVal[i]) cnt[i]++; 
            }*/
            sets[a] = sets[b] = sets[a] | sets[b]; 

        }
        else if (tc == 'Q'){
            int a,b; cin >> a >> b; a--; b--; 
            if (sets[a][b]) cout << "yes" << endl; 
            else cout << "no" << endl; 
        }
        else{
            int d; cin >> d; d--;
            cout << cnt[d] << endl; 
        }
    }

    return 0; 
}

• Subtask 1-1: 2 / 2
• Subtask 1-2: 0 / 3
• Subtask 2-1: 0 / 2
• Subtask 2-2: 0 / 3
• Subtask 3-1: 0 / 5
• Subtask 3-2: 0 / 5
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 12
• Subtask 5-2: 0 / 13
• Subtask 6-1: 0 / 17
• Subtask 6-2: 0 / 18