Problems solved: 595
Rank by points: #48
Total points:
124.71
Contribution points:
5
10 contests written
Rank by rating: #38
Rating:
Min. rating:
Max rating:
From Trường THPT chuyên Bình Long, Bình Phước, Trường Đại học Khoa học Tự nhiên - Đại học Quốc gia TP.HCM
About
Let's chill with me
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
ICPC World Finalist
IOI Medalist
APIO 2022 Medalist
VNOI Cup 2022 Finalist
Rating history
, #