Fixing typos

content/6_Advanced/Parallel_Binary_Search.mdx

@@ -20,15 +20,14 @@ frequency: 0
 <FocusProblem problem="sam" />
 
 ## Solution - New Roads Queries
-Let's think about how to use binary to answer single query.
-We can see that connvectivity of the nodes is a monotonic function.
+We can see that connectivity of the nodes is a monotonic function.
 
 Now let's use parallel binary search:
 
 First, sort the queries by median.
 
-Then sweep through the array of edges and union them in the DSU,
-whenevery there is a query with median = $i$, if the two nodes where connected in DSU, it means the answer is $\leq i$, otherwise it means $\gt i$.
+Then sweep through the array of edges and union them in the DSU.
+Whenever there is a query with median = $i$, if the two nodes where connected in DSU, it means the answer is $\leq i$, otherwise it means $\gt i$.
 
 **Complexity:**
 

content/6_Advanced/Parallel_Binary_Search.problems.json.save

@@ -0,0 +1,55 @@
+{
+ "MODULE_ID": "parallel-binary-search",
+ "sam": [
+ {
+ "uniqueId": "cses-2101",
+ "name": "New Roads Queries",
+ "url": "https://cses.fi/problemset/task/2101/",
+ "source": "CSES",
+ "difficulty": "Easy",
+ "isStarred": false,
+ "tags": ["PBS", "DSU"],
+ "solutionMetadata": {
+ "kind": "internal"
+ }
+ }
+ ],
+ "gen": [
+ {
+ "uniqueId": "hr-travelInHackerland",
+ "name": "Travel in Hackerland",
+ "url": "https://www.hackerrank.com/contests/may-world-codesprint/challenges/travel-in-hackerland",
+ "source": "HR",
+ "difficulty": "Easy",
+ "isStarred": true,
+ "tags": ["PBS", "DSU"],
+ "solutionMetadata": {
+ }
+ },
+ {
+ "uniqueId": "ac-stampRally",
+ "name": "Stamp Rally",
+ "url": "https://atcoder.jp/contests/agc002/tasks/agc002_d",
+ "source": "AC",
+ "difficulty": "Easy",
+ "isStarred": false,
+ "tags": ["PBS", "DSU"],
+ "solutionMetadata": {
+ "kind": "autogen-label-from-site",
+ "site": "AC"
+ }
+ },
+ {
+ "uniqueId": "coci-20-index",
+ "name": "2020 - Index",
+ "url": "https://evaluator.hsin.hr/tasks/HONI202167index/",
+ "source": "COCI",
+ "difficulty": "Normal",
+ "isStarred": false,
+ "tags": ["PBS", "Segtree"],
+ "solutionMetadata": {
+ "kind": "none"
+ }
+ }
+ ]
+}

content/6_Advanced/Parallel_Binary_Search.problems.json.save.1

@@ -0,0 +1,68 @@
+{
+ "MODULE_ID": "parallel-binary-search",
+ "sam": [
+ {
+ "uniqueId": "cses-2101",
+ "name": "New Roads Queries",
+ "url": "https://cses.fi/problemset/task/2101/",
+ "source": "CSES",
+ "difficulty": "Easy",
+ "isStarred": false,
+ "tags": ["PBS", "DSU"],
+ "solutionMetadata": {
+ "kind": "in-module",
+ "moduleId": "parallel-binary-search"
+ }
+ }
+ ],
+ "gen": [
+ {
+ "uniqueId": "ac-IndependentSet",
+ "name": "Independent Set",
+ "url": "{
+ "uniqueId": "ac-IndependentSet",
+ "name": "Independent Set",
+ "url": "https://atcoder.jp/contests/dp/tasks/dp_p",
+ "source": "AC",
+ "difficulty": "Easy",
+ "isStarred": true,
+ "tags": ["Tree", "DP"],
+ "solutionMetadata": {
+ "kind": "internal"
+ }
+ }",
+ "source": "AC",
+ "difficulty": "Easy",
+ "isStarred": true,
+ "tags": ["PBS", "DSU"],
+ "solutionMetadata": {
+ "kind": "none"
+ }
+ },
+ {
+ "uniqueId": "ac-stampRally",
+ "name": "Stamp Rally",
+ "url": "https://atcoder.jp/contests/agc002/tasks/agc002_d",
+ "source": "AC",
+ "difficulty": "Easy",
+ "isStarred": false,
+ "tags": ["PBS", "DSU"],
+ "solutionMetadata": {
+ "kind": "autogen-label-from-site",
+ "site": "AC"
+ }
+ },
+ {
+ "uniqueId": "coci-20-index",
+ "name": "2020 - Index",
+ "url": "https://evaluator.hsin.hr/tasks/HONI202167index/",
+ "source": "COCI",
+ "difficulty": "Normal",
+ "isStarred": false,
+ "tags": ["PBS", "Segtree"],
+ "solutionMetadata": {
+ "kind": "none"
+ }
+ }
+ ]
+}