• VNOJ
  • Home
  • PRoblems
  • Submissions
  • Users
    >
    • Organizations
  • Contests
  • Tag
  • About
    >
    • FAQ
    • Custom checker
    • Judges
    • Devlog
    • Github
    • Tickets
  • Wiki
  • Thư viện đề thi
VI EN Log in  or  Sign up

nghiass001

  • About
  • Statistics
  • Blogs

Problems solved: 586
Rank by points: #13
Total points: 124.25
Contribution points: 5

View submissions

8 contests written
Rank by rating: #6
Rating: 2494
Min. rating: 1939
Max rating: 2562

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

IOI Medalist

APIO 2022 Medalist

VNOI Cup 2022 Finalist

«    »
Sun
Mon
Tues
Wed
Thurs
Fri
Sat
Less
More

Rating history

, #

proudly powered by DMOJ | follow us on Github and Facebook