I have a couple of suggestions:

• Solve problems from The CSES Problemset. It contains 300 high quality problems from varying difficulties and subjects, and is constructed in a way that teaches you more important and useful algorithms and data structures than I can count on all my 5 10 20 fingers.

• Participate in OI style contests. that means contests like USACO, COCI, BOI, CEOI, JOI, APIO, IZHO and of course IOI (I might have even forgotten a few, look here). You don't need to be an official participant in order to compete, there are many online judges and mirrors for these contests. I would definitely recommend starting with USACO, it's divided into divisions so at each step the challenge will be 'easy' enough to be possible for you, but hard enough for you to improve by trying it.

• About codeforces, I feel it's different from IOI in many ways, but it's still a good way to improve you CP abilities. So yea why not, try reaching a high rating, but don't do too much cf and too little OI stuff because you won't improve nearly as fast.

Hope this helps you, wish you the best of luck!

Obviously I am no expert in this, but to me it seems that OI problems usually require more implementation than CF problems, and they can never be solved by a quick observation that has practically no coding. (On CF sometimes you can get by with little coding, example: https://mirror.codeforces.com/problemset/problem/1696/E, rated 2000, solution is 2 lines) For OI problems, I think that you have to be more methodical and precise about your observations, and can never really guess a solution like you can in CF.

CF contests and IOI are quite different in styles. For a CF contest you are usually given 5~7 problems and 2~3 hours, which is quite a short period so the tasks are designed in a way that it is possible to solve all of them (or almost all) in the contest duration (for top competitors in the world). This means that CF problems are more light-weighted and seldom require heavy implementation, especially in recent rounds. They also do not require you to have some really deep knowledge of some complex ideas. You can view CF problems as some math or algorithmic puzzles (as well as AtCoder problems, which somehow better fit the description). On the other hand, IOI-style contests often last for more than 5 hours, which is the least possible time for participants to at least come up with some fresh ideas, or implement complicated algorithms. This makes IOI problems much more difficult than CF problems. You may need to make some really awesome observations, or sweat out implementing some data structures.

I'm not saying that CF shouldn't be used for IOI preparation. In fact the last problems of most Div.1 rounds and some Div.2 rounds are quite challenging and are worth the time if you fully analyse them and come up with the solution (without reading editorials). And, as Um_nik mentions in this blog, it is just fun to participate in contests. (I strongly recommend checking that blog.)

Personally I don't know some particularly good IOI training websites. As I myself come from China, I can tell you that Chinese online judges aren't the best way to train for IOI — they aren't bad, though, with many hard problems whose solutions are considered 'mysterious' elsewhere. The not-so-good point is that they contain too many problems, and many require way too heavy implementation. Also some problems are a bit off-the-topic, that is, they require you to learn something, some technique that is never used in other CP problems. In contrast, I guess USACO and recent JOISC are best training resources. These problems are quite interesting, and meanwhile teach you a lot.

I'm currently preparing for IOI since I qualify in my national olympiad and codeforces/atocder/USACO are similar to the problems I am aiming to solve (it is not the same to train for a bronze medal and training for winning IOI), so if your goal is to get bronze cofeforces/USACO/atcoder + CSES + Competitive programmer's handbook are nice resources for prectice and theory.

I would want to remember you that national olympiad may difer from IOI and if you want to qualify for IOI the first step is to study your national olympiad (what type of problems are there, heavy/light implementation...) for example the spanish olympiad tend to put a lot of interactive problems (1/5 more or less) a lot of graph problems, a impossible problem no one solve per day and 2 easy problems (5 problems in total per day, 2 days) and a real lot of math problems. Go to past national olympiad and check what to focus on!

I've been in CP for 6 months and participated in the Syrian and Asian Olympiad, and from what I've experienced OI style problems focus on algorithms more than CF, however CF has a lot of fun problems with brilliant ideas that can improve problem solving skills, and as Alon-Tanay suggested above participating in OI style contests can help a lot too

timmyfeng (orz) qualified for IOI from US and got a gold medal last year with primarily only practicing on codeforces.

It depends exactly on the style of problems for your country's selection process, but I think codeforces covers everything you need to know as long as you do enough problems on here and in past few years has higher quality problems on average than those from a bit older OI archives, which are often a bit too standard. Just make sure you do some more recent OI problems and a few OI virtual contests as well so you are familiar with OI format and strategy (in particular, how to allocate time among problems and subtasks).

Just make sure you are trying to increase the rating you practice over time and are not stuck solving too many low-rated problems, which are not too useful.

damn, you're now an expert bro. can u share the method u used to pratice plzz orzz