Problems solved: 591
Rank by points: #4
Total points:
123.47
Contribution points:
5
8 contests written
Rank by rating: #4
Rating: 2477
Min. rating: 1938
Max rating: 2545
From Trường THPT chuyên Bình Long, Bình Phước
About
Traning IOI
vector<pair<int,int>> findTree(vector<int> vec) {
sort(vec.begin(), vec.end(), [&] (int u, int v) {
return sta[u] < sta[v];
});
int sz = vec.size();
for(int i = 1; i <= sz - 1; i++) {
vec.push_back(lca(vec[i - 1], vec[i]));
}
sort(vec.begin(), vec.end(), [&] (int u, int v) {
return sta[u] < sta[v];
});
vec.resize(distance(vec.begin(), unique(vec.begin(), vec.end())));
}
Badges & Awards
This user has not earned any badges or awards.Rating history
, #