이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4001;
set <int> dd[MAXN];
set <int> pp[MAXN];
int main () {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
dd[i].insert(i); pp[i].insert(i);
}
for (int i = 1; i <= n + k - 1; i++) {
char c;
cin >> c;
if (c == 'S') {
int a, b;
cin >> a >> b;
for (auto j : dd[b]) dd[a].insert(j);
for (auto j : dd[a]) dd[b].insert(j);
for (auto j : dd[b]) pp[j].insert(b);
for (auto j : dd[a]) pp[j].insert(a);
} else if (c == 'Q') {
int x, y;
cin >> x >> y;
cout << (dd[x].count(y) ? "yes\n" : "no\n");
} else {
int x;
cin >> x;
cout << pp[x].size() << '\n';
}
}
}
# | 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... |