# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1224424 | KALARRY | Inside information (BOI21_servers) | C++20 | 3596 ms | 589824 KiB |
//chockolateman
#include<bits/stdc++.h>
using namespace std;
int N,K;
set<int> contain[120005];
int main()
{
scanf("%d%d",&N,&K);
for(int i = 1 ; i <= N ; i++)
contain[i].insert(i);
for(int a,b,i = 1 ; i <= N + K - 1 ; i++)
{
char op;
scanf(" %c",&op);
scanf("%d",&a);
if(op=='C')
{
int counter = 0;
for(int j = 1 ; j <= N ; j++)
if(contain[j].count(a))
counter++;
printf("%d\n",counter);
}
else if(op=='Q')
{
scanf("%d",&b);
if(contain[a].count(b))
printf("yes\n");
else
printf("no\n");
}
else
{
scanf("%d",&b);
for(auto l : contain[a])
contain[b].insert(l);
for(auto l : contain[b])
contain[a].insert(l);
}
}
return 0;
}
Compilation message (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... |