# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1264614 | tminh | Synchronization (JOI13_synchronization) | C++20 | 36 ms | 2628 KiB |
#include "bits/stdc++.h"
using namespace std;
#define task ""
#define ll long long
#define endl '\n'
#define u first
#define v second
#define vall(a) (a).begin(), (a).end()
#define sze(a) (int)a.size()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ep emplace_back
#define pb push_back
#define pf push_front
const ll mod = 1e9 + 7;
const int N = 1e6 + 5;
const ll oo = 1e18;
bool START;
int n, m, par[N], sz[N], szz[N], q;
pii e[N];
bool vis[N];
// so lan doc sol roi moi biet lam :
int find(int v) {
return (v == par[v] ? v : par[v] = find(par[v]));
}
void merge(int a, int b) {
int A = find(a);
int B = find(b);
if (A != B) {
szz[a] += sz[B];
szz[b] += sz[A];
if (sz[A] < sz[B]) swap(A, B);
par[B] = A;
sz[A] += sz[B];
}
}
inline void solve() {
for (int i = 1; i <= n; ++i) {
sz[i] = szz[i] = 1;
par[i] = i;
}
for (int i = 1; i <= m; ++i) {
int x; cin >> x;
if (vis[x]) continue;
merge(e[x].u, e[x].v);
}
while(q--) {
int x; cin >> x;
cout << szz[x] << endl;
}
}
inline void input() {
cin >> n >> m >> q;
for (int i = 1; i < n; ++i) cin >> e[i].u >> e[i].v;
return solve();
}
bool END;
int main() {
if(fopen(task ".inp", "r")) {
freopen(task ".inp", "r", stdin);
freopen(task ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
input();
cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << 's' << endl;
cerr << "Memory: " << fabs ((&END - &START)) / 1048576.0 << "MB\n";
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... |