# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287756 | shrek12357 | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;
#define MAXN 50
int sz[MAXN], par[MAXN];
int get(int x) {
return x == par[x] ? x : par[x] = get(par[x]);
}
void unite(int a, int b) {
a = get(a), b = get(b);
if (a == b) {
return;
}
if (sz[a] > sz[b]) {
swap(a, b);
}
par[a] = b;
sz[b] += sz[a];
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 0; i < MAXN; i++) {
sz[i] = 1;
par[i] = i;
}
vector<pair<int, pair<int, int>>> edges;
for (int i = 0; i < n - 1; i++) {
int a, b, c;
cin >> a >> b >> c;
edges.push_back({ c * -1,{ a, b } });
}
vector<pair<int, int>> queries, ord;
for (int i = 0; i < q; i++) {
int a, b;
cin >> a >> b;
queries.push_back(make_pair(a * -1, b));
ord.push_back(make_pair(a*-1, b));
}
sort(edges.begin(), edges.end());
sort(queries.begin(), queries.end());
map<pair<int, int>, int> ans;
int idx = -1;
for (int i = 0; i < q; i++) {
int rel = queries[i].first;
while (idx < n - 2 && edges[idx + 1].first <= rel) {
idx++;
unite(edges[idx].second.first, edges[idx].second.second);
}
ans[queries[i]] = sz[get(queries[i].second)] - 1;
//cout << sz[get(queries[i].second)] << endl;
}
for (int i = 0; i < ord.size(); i++) {
cout << ans[ord[i]] << endl;
}
}