이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int n, k;
cin >> n >> k;
set<int> st[n + 1];
for (int i = 1; i <= n; i++)
st[i].insert(i);
int cnt[n + 1];
for (int i = 1; i <= n; i++)
cnt[i] = 1;
for (int q = 0; q < n + k - 1; q++) {
char t;
cin >> t;
if (t == 'S') {
int a, b;
cin >> a >> b;
for (auto x: st[b])
if (st[a].find(x) == st[a].end())cnt[x]++;
for (auto x: st[a])
if (st[b].find(x) == st[b].end())cnt[x]++;
for (auto x: st[b])
st[a].insert(x);
st[b] = st[a];
} else if (t == 'Q') {
int a, d;
cin >> a >> d;
if (st[a].find(d) == st[a].end())
cout << "no\n";
else
cout << "yes\n";
} else {
int a;
cin >> a;
cout << cnt[a] << "\n";
}
}
return 0;
}
# | 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... |