Segcolt/Codeforces-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add some more problems and update TODO list

Browse Source
This commit is contained in:
Segcolt
2025-10-30 17:11:49 -03:00
parent cf5a83fb09
commit 97ebdbf890
54 changed files with 8355 additions and 36 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
TODO.md
View File

@@ -13,58 +13,79 @@ Official divs from codeforces
- Educational
1. [F. Frogs and Mosquitoes](https://codeforces.com/contest/609/problem/F)
- [ ] [F. Frogs and Mosquitoes](https://codeforces.com/contest/609/problem/F)
I have no clue where to even start.
2. [E. Water Taps](https://codeforces.com/contest/954/problem/E)
- [ ] [E. Water Taps](https://codeforces.com/contest/954/problem/E)
I have an idea, but it's really annoying to solve it.
3. [F. Fibonacci String Subsequences](https://codeforces.com/contest/946/problem/F)
- [ ] [F. Fibonacci String Subsequences](https://codeforces.com/contest/946/problem/F)
Obviously DP, but not sure how to do it...
4. [F. Imbalance Value of Tree](https://codeforces.com/contest/915/problem/F)
- [ ] [F. Imbalance Value of Tree](https://codeforces.com/contest/915/problem/F)
Tree problem, looks interesting.
5. [F. Clear The Matrix](https://codeforces.com/contest/903/problem/F)
- [ ] [F. Clear The Matrix](https://codeforces.com/contest/903/problem/F)
DP with optimization?
- [ ] [D. Sums of Segments](https://codeforces.com/problemset/problem/2026/D)
Another problem that I didn't have time to finish...
- Div 1/2
1. [D. Division Versus Addition](https://codeforces.com/contest/2152/problem/D)
- [ ] [D. Division Versus Addition](https://codeforces.com/contest/2152/problem/D)
The idea is simple, but I have to think through it better.
2. [D2. Inversion Graph Coloring](https://codeforces.com/contest/2143/problem/D2)
- [ ] [D2. Inversion Graph Coloring](https://codeforces.com/contest/2143/problem/D2)
DP with optimization.
3. [E. Yet Another MEX Problem](https://codeforces.com/contest/2146/problem/E)
- [ ] [E. Yet Another MEX Problem](https://codeforces.com/contest/2146/problem/E)
Maybe MEX with two pointers?
4. [D. A Cruel Segment's Thesis](https://codeforces.com/contest/2140/problem/D)
- [ ] [D. A Cruel Segment's Thesis](https://codeforces.com/contest/2140/problem/D)
Looks greedy.
5. [F. Flint and Steel](https://codeforces.com/contest/2133/problem/F)
- [ ] [F. Flint and Steel](https://codeforces.com/contest/2133/problem/F)
I tried this a long time ago, don't remember what it's about, just remembered
that I tried a greedy solution and it didn't work.
- [ ] [C. Music Festival](https://codeforces.com/problemset/problem/1801/C)
Looks like DP.
- [ ] [C1. Maple and Tree Beauty (Easy Version)](https://codeforces.com/problemset/problem/2138/C1)
I finished with one type of knapsack, but apparently there's a better way to do
it that's going to be used to optimize later.
- [ ] [D1. Hot Start Up (easy version)](https://codeforces.com/contest/1799/problem/D1)
DP, but couldn't do during the simulation...
- Div 3
1. [G. Cry Me a River](https://codeforces.com/contest/2137/problem/G)
- [ ] [G. Cry Me a River](https://codeforces.com/contest/2137/problem/G)
Graph problem, don't remember the details.
- [ ] [XORificator 3000](https://codeforces.com/problemset/problem/2036/F)
I had an idea, but didn't have time to implement it.
- Div 4
1. [F. Gravity Falls](https://codeforces.com/contest/2148/problem/F)
- [ ] [F. Gravity Falls](https://codeforces.com/contest/2148/problem/F)
I barely read it, not sure were I found it either, but looks pretty easy.
@@ -74,7 +95,7 @@ Gym from simulations or contests that I did
- ICPC Brazil first phase
1. [D. Dominoes](https://codeforces.com/gym/106073/problem/D)
- [ ] [D. Dominoes](https://codeforces.com/gym/106073/problem/D)
If I did this one, I would have passed into second phase, must try to solve it
ASAP.
@@ -83,22 +104,28 @@ Gym from simulations or contests that I did
[Link](https://codeforces.com/gym/104875) because it has no problem page in gym.
1. L. Last Guess
- [ ] L. Last Guess
I think I can solve it with flow.
- USP Try-outs
1. [B. Tuk-Tuk Express](https://codeforces.com/gym/103934/problem/B)
- [ ] [B. Tuk-Tuk Express](https://codeforces.com/gym/103934/problem/B)
I have NO clue why my code keeps getting WA, awful implementation problem.
2. [J. Apep, the Lord of Chaos](https://codeforces.com/gym/103934/problem/J)
- [ ] [J. Apep, the Lord of Chaos](https://codeforces.com/gym/103934/problem/J)
I don't remember what the problem was about, I just know that I tried it before.
- think-cell round 1
- [X] [C. Lexicographically Largest](https://codeforces.com/problemset/problem/1930/C)
I'll be honest, I just got bored in the middle.
## Atcoder
1. [F. Operate K](https://atcoder.jp/contests/abc386/tasks/abc386_f)
- [ ] [F. Operate K](https://atcoder.jp/contests/abc386/tasks/abc386_f)
DP with optimization.