Daddy's Journey to Platinum

Additional Problems

1. Shortest Subsequence 
2. Counting Bits 
3. Swap Game 
4. Prufer Code 
5. Acyclic Graph Edges 
6. Strongly Connected Edges 
7. Even Outdegree Edges 
8. Multiplication Table 
9. Advertisement
10. Special Substrings 
11. Permutation Inversions 
12. Maximum Xor Subarray 
13. Movie Festival Queries 
14. Chess Tournament 
15. Tree Traversals 
16. Network Renovation 
17. Graph Girth 
18. Intersection Points 
19. Inverse Inversions 
20. Monotone Subsequences 
21. String Reorder 
22. Stack Weights 
23. Pyramid Array 
24. Increasing Subsequence II 
25. String Removals 
26. Bit Inversions 
27. Xor Pyramid 
28. Writing Numbers 
29. String Transform 
30. Letter Pair Move Game 
31. Maximum Building I 
32. Sorting Methods 
33. Cyclic Array
34. List of Sums 
35. Increasing Array II 
36. Food Division 
37. Bit Problem 
38. Swap Round Sorting 
39. Binary Subsequences 
40. Tree Isomorphism I 
41. Counting Sequences 
42. Critical Cities 
43. School Excursion 
44. Coin Grid 
45. Robot Path 
46. Programmers and Artists 
47. Course Schedule II
48. Removing Digits II 
49. Coin Arrangement 
50. Counting Bishops 
51. Grid Puzzle I 
52. Grid Puzzle II 
53. Empty String 
54. Grid Paths 
55. Bit Substrings 
56. Reversal Sorting 
57. Counting Reorders 
58. Book Shop II 
59. Network Breakdown 
60. Visiting Cities 
61. Missing Coin Sum Queries 
62. Number Grid 
63. Maximum Building II 
64. Filling Trominos 
65. Stick Divisions 
66. Coding Company 
67. Flight Route Requests 
68. Two Stacks Sorting 
69. Tree Isomorphism II 
70. Forbidden Cities 
71. Area of Rectangles 
72. Grid Completion 
73. Creating Offices 
74. Permutations II 
75. Functional Graph Distribution 
76. New Flight Routes 
77. Grid Path Construction 

CSES Problem Set 소개 (link)

Advanced Techniques

1. Meet in the Middle 
2. Hamming Distance 
3. Beautiful Subgrids 
4. Reachable Nodes 
5. Reachability Queries 
6. Cut and Paste 
7. Substring Reversals 
8. Reversals and Sums 
9. Necessary Roads 
10. Necessary Cities 
11. Eulerian Subgraphs 
12. Monster Game I 
13. Monster Game II 
14. Subarray Squares 
15. Houses and Schools 
16. Knuth Division 
17. Apples and Bananas 
18. One Bit Positions 
19. Signal Processing 
20. New Roads Queries 
21. Dynamic Connectivity 
22. Parcel Delivery 
23. Task Assignment 
24. Distinct Routes II 

CSES Problem Set 소개 (link)

Geometry

1. Point Location Test 
2. Line Segment Intersection 
3. Polygon Area 
4. Point in Polygon 
5. Polygon Lattice Points 
6. Minimum Euclidean Distance 
7. Convex Hull 

CSES Problem Set 소개 (link)

String Algorithms

1. Word Combinations 
2. String Matching 
3. Finding Borders 
4. Finding Periods 
5. Minimal Rotation ( 1 )
6. Longest Palindrome 
7. Required Substring 
8. Palindrome Queries 
9. Finding Patterns 
10. Counting Patterns 
11. Pattern Positions 
12. Distinct Substrings 
13. Repeating Substring 
14. String Functions 
15. Substring Order I 
16. Substring Order II 
17. Substring Distribution 

CSES Problem Set 소개 (link)

Tree Algorithms

1. Subordinates
2. Tree Matching
3. Tree Diameter
4. Tree Distances
5. Tree Distances
6. Company Queries I 
7. Company Queries II 
8. Distance Queries 
9. Counting Paths 
10. Subtree Queries 
11. Path Queries 
12. Path Queries II 
13. Distinct Colors 
14. Finding a Centroid 
15. Fixed-Length Paths I 
16. Fixed-Length Paths II 

CSES Problem Set 소개 ( https://daddysjourney.tistory.com/pages/CSES-Problems ) 

Range Queries 

1. Static Range Sum Queries
2. Static Range Minimum Queries
3. Dynamic Range Sum Queries
4. Dynamic Range Minimum Queries
5. Range Xor Queries
6. Range Update Queries
7. Forest Queries
8. Hotel Queries
9. List Removals
10. Salary Queries
11. Prefix Sum Queries
12. Pizzeria Queries
13. Subarray Sum Queries
14. Distinct Values Queries
15. Increasing Array Queries
16. Forest Queries II 
17. Range Updates and Sums
18. Polynomial Queries
19. Range Queries and Copies

CSES Problem set 소개 ( link )

출처: https://cses.fi/problemset/task/1745

문제 설명

입력 

출력

입력 예

출력 예

제약조건

문제 풀이

프로그램 내용

vector<bool> dp(n*1000+1);
...
for (int c : coins) 
{
	for (int i = dp.size() - 1; i > 0; i--) 
	{
            if (dp[i]) 
                dp[i + c] = 1; 
            d[c] = 1; 
	}
}
...

Dynamic Programming ( link )

출처: https://cses.fi/problemset/1744

문제 설명

입력 

출력

입력 예

출력 예

제약조건

문제 풀이

프로그램 내용

...   
for(int i=1; i<=a; ++i) {
	for(int j=1; j<=b; ++j) {
		if(i^j)
			dp[i][j]= INT_MAX;
		for(int k=1; k<i; ++k) // 가로로 자르는 경우
			dp[i][j]=min(dp[i][j], dp[k][j]+dp[i-k][j]+1);
		for(int k=1; k<j; ++k) // 세로로 자르는 경우
			dp[i][j]=min(dp[i][j], dp[i][k]+dp[i][j-k]+1);
	}
}
...

Dynamic Programming ( link )

출처:  https://cses.fi/problemset/task/1639

문제 설명

입력 

출력

입력 예

출력 예

제약조건

문제 풀이

프로그램 내용

...
for(int i=0; i <= m; ++i)
{
	for (int j=0; j <= n ; ++j)
	{
		if ( i == 0)
        	dist[i][j] = j; /// init for desStr
		else if ( j == 0)
        	dist[i][j] = i; /// init for srcStr
		else if ( srcStr[i-1] == desStr[j-1])
        	dist[i][j] = dist[i-1][j-1];
		else
        	dist[i][j] = 1 + min({	dist[i-1][j],      /// insert
									dist[i][j-1],      /// remove
									dist[i-1][j-1]});   /// replace
	}
}
...

Dynamic Programming ( link )

출처: https://cses.fi/problemset/task/1675

문제 설명

입력 

출력

입력 예

출력 예

제약조건

문제 풀이

프로그램 내용

for(int id=0; id < tE; ++id)
{
	int a, b, c;
	cin >> a >> b >> c;
	vt.push_back({c, a, b});
}        
...
long sum = 0;
int cnt = tN;
for(int id=0; id < tE; ++id)
{
	int a, b, c;
	tie(c, a, b) = vt[id];
	if(merge(a, b))	/// union
	{
		sum += c;
		cnt--;
	}
}
...

 Graph Algorithms ( link )