Competitive Programming 4

Competitive Programming 4

Language
English
Year
2020
File Type
pdf
File Size
14.7 MiB

CP4: Book 1Contents1 Introduction1.1 Competitive Programming1.2 The Competitions1.2.1 International Olympiad in Informatics (IOI)1.2.2 International Collegiate Programming Contests (ICPC)1.2.3 Other Programming Contests1.3 Tips to be Competitive1.3.1 Tip 1: Type Code Faster!1.3.2 Tip 2: Quickly Identify Problem Types1.3.3 Tip 3: Do Algorithm Analysis1.3.4 Tip 4: Master Programming Languages1.3.5 Tip 5: Master the Art of Testing Code1.3.6 Tip 6: Practice and More Practice1.3.7 Tip 7: Team Work (for ICPC)1.4 Getting Started: The Easy Problems1.4.1 Anatomy of a Programming Contest Problem1.4.2 Typical Input/Output Routines1.4.3 Time to Start the Journey1.4.4 Getting Our First Accepted (AC) Verdict1.5 Basic String Processing Skills1.6 The Ad Hoc Problems1.7 Solutions to Non-Starred Exercises1.8 Chapter Notes2 Data Structures and Libraries2.1 Overview and Motivation2.2 Linear DS with Built-in Libraries2.2.1 Array2.2.2 Special Sorting Problems2.2.3 Bitmask2.2.4 Big Integer (Python & Java)2.2.5 Linked Data Structures2.2.6 Special Stack-based Problems2.3 Non-Linear DS with Built-in Libraries2.3.1 Binary Heap (Priority Queue)2.3.2 Hash Table2.3.3 Balanced Binary Search Tree (bBST)2.3.4 Order Statistics Tree2.4 DS with Our Own Libraries2.4.1 Graph2.4.2 Union-Find Disjoint Sets2.4.3 Fenwick (Binary Indexed) Tree2.4.4 Segment Tree2.5 Solution to Non-Starred Exercises2.6 Chapter Notes3 Problem Solving Paradigms3.1 Overview and Motivation3.2 Complete Search3.2.1 Iterative Complete Search3.2.2 Recursive Complete Search3.2.3 Complete Search Tips3.2.4 Complete Search in Programming Contests3.3 Divide and Conquer3.3.1 Interesting Usages of Binary Search3.3.2 Ternary Search3.3.3 Divide and Conquer in Programming Contests3.4 Greedy3.4.1 Examples3.4.2 Greedy Algorithm in Programming Contests3.5 Dynamic Programming3.5.1 DP Illustration3.5.2 Classical Examples3.5.3 Non-Classical Examples3.5.4 Dynamic Programming in Programming Contests3.6 Solution to Non-Starred Exercises3.7 Chapter Notes4 Graph4.1 Overview and Motivation4.2 Graph Traversal4.2.1 Overview and Motivation4.2.2 Depth First Search (DFS)4.2.3 Breadth First Search (BFS)4.2.4 Finding Connected Components (Undirected Graph)4.2.5 Flood Fill (Implicit 2D Grid Graph)4.2.6 Topological Sort (Directed Acyclic Graph)4.2.7 Bipartite Graph Check (Undirected Graph)4.2.8 Cycle Check (Directed Graph)4.2.9 Finding Articulation Points and Bridges (Undirected Graph)4.2.10 Finding Strongly Connected Components (Directed Graph)4.2.11 Graph Traversal in Programming Contests4.3 Minimum Spanning Tree (MST)4.3.1 Overview and Motivation4.3.2 Kruskal’s Algorithm4.3.3 Prim’s Algorithm4.3.4 Other Applications4.3.5 MST in Programming Contests4.4 Single-Source Shortest Paths (SSSP)4.4.1 Overview and Motivation4.4.2 On Unweighted Graph: BFS4.4.3 On Weighted Graph: Dijkstra’s4.4.4 On Small Graph (with Negative Cycle): Bellman-Ford4.4.5 SSSP in Programming Contests4.5 All-Pairs Shortest Paths (APSP)4.5.1 Overview and Motivation4.5.2 Floyd-Warshall Algorithm4.5.3 Other Applications4.5.4 APSP in Programming Contests4.6 Special Graphs4.6.1 Directed Acyclic Graph4.6.2 Tree4.6.3 Bipartite Graph4.6.4 Eulerian Graph4.6.5 Special Graphs in Programming Contests4.7 Solution to Non-Starred Exercises4.8 Chapter NotesIndex

show more...

How to Download?!!!

Just click on START button on Telegram Bot

Free Download Book