| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1224463 | KALARRY | Inside information (BOI21_servers) | C++20 | 3564 ms | 589824 KiB | 
//chockolateman
#include<bits/stdc++.h>
using namespace std;
int N,K,counter[120005],x[120005],y[120005];
char op[120005];
set<int> contain[120005];
int main()
{
    scanf("%d%d",&N,&K);
    for(int i = 1 ; i <= N ; i++)
    {
        counter[i] = 1;
        contain[i].insert(i);
    }
    // for(int i = 1 ; i <= N + K - 1 ; i++) 
    // {
    //     scanf(" %c",&op[i]);
    //     scanf("%d",&x[i]);
    //     if(op[i] != 'C')
    //         scanf("%d",&y[i]);
    // }
    for(int a,b,i = 1 ; i <= N + K - 1 ; i++)
    {
        scanf(" %c",&op[i]);
        scanf("%d",&x[i]);
        a = x[i];
        if(op[i]=='C')
            printf("%d\n",counter[a]);
        else if(op[i]=='Q')
        {
            scanf("%d",&y[i]);
            b = y[i];
            // scanf("%d",&b);
            if(contain[a].count(b))
                printf("yes\n");
            else
                printf("no\n");
        }
        else
        {
            scanf("%d",&y[i]);
            b = y[i];
            // scanf("%d",&b);
            for(auto l : contain[a])
            {
                if(contain[b].count(l)==0)
                    counter[l]++;
                contain[b].insert(l);
            }
            for(auto l : contain[b])
            {
                if(contain[a].count(l)==0)
                    counter[l]++;
                contain[a].insert(l);
            }
        }
    }
    return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
