From 5d2554cb87ddc77740dbee214115537ebb8f3f22 Mon Sep 17 00:00:00 2001 From: Yawn-Sean <1900015431@pku.edu.cn> Date: Sat, 5 Oct 2024 09:30:06 +0800 Subject: [PATCH] Add links to editorials --- README.md | 4 ++-- categories/data_structures.md | 3 ++- categories/graph.md | 1 + categories/greedy.md | 1 + 4 files changed, 6 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index e5cd0fd89d..226ca4622e 100644 --- a/README.md +++ b/README.md @@ -24,5 +24,5 @@ Here are the current statistics of submissions: [Link](https://yawn-sean.github. | Difficulty | Problems | Hints | Solution | | -------- | -------- | -------- | -------- | -| 1600 | [CF922C](https://codeforces.com/problemset/problem/922/C) | Actually, you can find out each $n\bmod i$. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1004/solution/cf922c.md) | -| 2100 | [CF748E](https://codeforces.com/problemset/problem/748/E) | $10^7$ should be used. Find out the maximum number of students who can get at least $k$ slices for each $k$. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1004/solution/cf748e.md) | \ No newline at end of file +| 1600 | [CF731C](https://codeforces.com/problemset/problem/731/C) | Each day provide a condition that the colors of the chosen pairs are the same. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1005/solution/cf731c.md) | +| 2300 | [CF558D](https://codeforces.com/problemset/problem/558/D) | Each condition represents $1/2$ segments in the leaves. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1005/solution/cf558d.md) | \ No newline at end of file diff --git a/categories/data_structures.md b/categories/data_structures.md index ee938c81ae..7d201d6f06 100644 --- a/categories/data_structures.md +++ b/categories/data_structures.md @@ -71,4 +71,5 @@ | 2200 | [CF538F](https://codeforces.com/problemset/problem/538/F) | For each $k$, how many conditions should you check? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/08/0803/solution/cf538f.md) | | 2200 | [CF1039C](https://codeforces.com/problemset/problem/1039/C) | For each $x$, find the number of corresponding methods. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/08/0817/solution/cf1039c.md) | | 2200 | [CF431E](https://codeforces.com/problemset/problem/431/E) | You should fill up the containers with the minimum number of mercury first. How much volume can you put in them without exceeding the other containers? How can you calculate it efficiently? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/08/0824/solution/cf431e.md) | -| 2200 | [CF413E](https://codeforces.com/problemset/problem/413/E) | Classic segment tree problem. It's just what variable should you choose. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0921/solution/cf413e.md) | \ No newline at end of file +| 2200 | [CF413E](https://codeforces.com/problemset/problem/413/E) | Classic segment tree problem. It's just what variable should you choose. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0921/solution/cf413e.md) | +| 2300 | [CF558D](https://codeforces.com/problemset/problem/558/D) | Each condition represents $1/2$ segments in the leaves. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1005/solution/cf558d.md) | \ No newline at end of file diff --git a/categories/graph.md b/categories/graph.md index 2f71e47bd2..a1cf190780 100644 --- a/categories/graph.md +++ b/categories/graph.md @@ -5,6 +5,7 @@ | 1600 | [CF1609D](https://codeforces.com/problemset/problem/1609/D) | If you have a connected component, you can re-arrange the edges in it. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/05/0510/solution/cf1609d.md) | | 1600 | [CF1095D](https://codeforces.com/problemset/problem/1095/D) | If you decide one edge, the whole circle should be fully determined. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/05/0524/solution/cf1095d.md) | | 1600 | [CF954D](https://codeforces.com/problemset/problem/954/D) | How does the length of shortest path change when you add an edge? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/07/0720/solution/cf954d.md) | +| 1600 | [CF731C](https://codeforces.com/problemset/problem/731/C) | Each day provide a condition that the colors of the chosen pairs are the same. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1005/solution/cf731c.md) | | 1700 | [CF1045I](https://codeforces.com/problemset/problem/1027/D) | Turn the array into a graph. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/03/0330/solution/cf1045i.md) | | 1700 | [CF765D](https://codeforces.com/problemset/problem/765/D) | The problem is about a graph. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/04/0424/solution/cf765d.md) | | 1700 | [CF489D](https://codeforces.com/problemset/problem/489/D) | Counting a pattern in a graph: find the special part. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/07/0710/solution/cf489d.md) | diff --git a/categories/greedy.md b/categories/greedy.md index 79ded6a84b..ad351b40a2 100644 --- a/categories/greedy.md +++ b/categories/greedy.md @@ -19,6 +19,7 @@ | 1600 | [CF615B](https://codeforces.com/problemset/problem/615/B) | Calculate the longest tail for each node. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0920/solution/cf615b.md) | | 1600 | [CF416C](https://codeforces.com/problemset/problem/416/C) | Consider each table from small to large. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0927/solution/cf416c.md) | | 1600 | [CF429B](https://codeforces.com/problemset/problem/429/B) | Consider the path around the intersection position. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0928/solution/cf429b.md) | +| 1600 | [CF731C](https://codeforces.com/problemset/problem/731/C) | Each day provide a condition that the colors of the chosen pairs are the same. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1005/solution/cf731c.md) | | 1700 | [CF1185C2](https://codeforces.com/problemset/problem/1185/C2) | Greedy approach. Maintain them in a data structure | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/03/0304/solution/cf1185c2.md) | | 1700 | [CF827A](https://codeforces.com/problemset/problem/827/A) | Fill up the strings. Avoid filling up the same blank twice. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/03/0313/solution/cf827a.md) | | 1700 | [CF1413D](https://codeforces.com/problemset/problem/1413/D) | Classic data structure problem. Each `- x` offers a constraint. Note that you don't have to process the events online and you can order the items. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/03/0326/solution/cf1413d.md) |