aben20807 / oj_code

1062_高階競技程式設計 ADVANCED COMPETITIVE PROGRAMMING

Practice in Online Judge

• : have comments.

Basic

• UVa/100_The_3n+1_problem
• UVa/10055_Hashmat_the_brave_warrior
• UVa/10424_Love_Calculator
• UVa/11727_Cost_Cutting
• UVa/11984_A_Change_in_Thermal_Unit
• UVa/11462_Age_Sort
• UVa/10922_2_the_9s
• UVa/488_Triangle_Wave
• UVa/10633_Rare_Easy_Problem
• UVa/10679_I_Love_Strings: try to use Aho-Corasick Automaton
• leetcode/70-climbing-stairs
• leetcode/790-domino-and-tromino-tiling

Data structure

Linked list

• leetcode/2-add-two-numbers
• leetcode/328-odd-even-linked-list

Stack

• leetcode/150-evaluate-reverse-polish-notation
• leetcode/232-implement-queue-using-stacks
• leetcode/739-daily-temperatures

Heap

• leetcode/1962-remove-stones-to-minimize-the-total
• leetcode/1834-single-threaded-cpu: priority queue (C failed, using C++ instead)

Sort

• UVa/10327_Flip_Sort: Bubble Sort
• UVa/10810_Ultra-QuickSort: Merge Sort
• UVa/(POJ)2299_Ultra-QuickSort
• UVa/10107_What_is_the_Median: Insertion Sort

Greedy

• leetcode/55-jump-game
• leetcode/2279-maximum-bags-with-full-capacity-of-rocks

Union-Find

• UVa/10685_Nature
• UVa/10583_Ubiquitous_Religions
• UVa/11987_Almost_Union-Find

STL

• UVa/10420_List_of_Conquests: Map
• UVa/136_Ugly_Numbers: Vector
• UVa/902_Password_Search: Map
• UVa/10226_Hardwood_Species: Map
• UVa/10391_Compound_Words: Map

DFS

• UVa/539_The_Settlers_of_Catan
• UVa/352_The_Seasonal_War
• UVa/260_Il_Gioco_dellX
• UVa/10004_Bicoloring
• UVa/10946_You_want_what_filled
• leetcode/124-binary-tree-maximum-path-sum
• leetcode/834-sum-of-distances-in-tree: double DFS
• leetcode/841-keys-and-rooms
• leetcode/872-leaf-similar-trees
• leetcode/938-range-sum-of-bst
• leetcode/1026-maximum-difference-between-node-and-ancestor
• leetcode/1339-maximum-product-of-splitted-binary-tree: double DFS
• leetcode/797-all-paths-from-source-to-target: all paths

BFS

• UVa/532_Dungeon_Master
• UVa/439_Knight_Moves
• UVa/383_Shipping_Routes
• UVa/567_Risk
• UVa/762_We_Ship_Cheap
• leetcode/1971-find-if-path-exists-in-graph

Prime

• UVa/406_Prime_Cuts

Prime factor

• UVa/10392_Factoring_Large_Numbers
• UVa/294_Divisors

GCD

• UVa/408_Uniform_Generator
• UVa/10104_Euclid_Problem

Big number

• UVa/10106_Product

Floating point

• UVa/906_Rational_Neighbor

Binary search

• UVa/10474_Where_is_the_Marble
• UVa/10341_Solve_It
• UVa/10611_The_Playboy_Chimp
• leetcode/2389-longest-subsequence-with-limited-sum: prefix sum

Backtracking

• UVa/441_Lotto
• UVa/167_The_Sultans_Successors
• UVa/291_The_House_Of_Santa_Claus
• UVa/524_Prime_Ring_Problem
• UVa/574_Sum_It_Up
• UVa/624_CD
• UVa/750_8_Queens_Chess_Problem

DP

• UVa/674_Coin_Change
• UVa/990_Diving_for_gold
• UVa/10819_Trouble_of_13-Dots
• UVa/10306_e-Coins: 2D
• UVa/108_Maximum_Sum: 2D
• leetcode/198-house-robber: 1D
• leetcode/309-best-time-to-buy-and-sell-stock-with-cooldown: FSM
• leetcode/931-minimum-falling-path-sum: 2D

LCS

• UVa/531_Compromise
• UVa/111_History_Grading
• UVa/10066_The_Twin_Towers
• UVa/10100_Longest_Match
• UVa/10192_Vacation
• UVa/10252_Common_Permutation: sort
• UVa/10405_Longest_Common_Subsequence
• leetcode/1143-longest-common-subsequence

LIS (LDS)

• UVa/231_Testing_the_CATCHER
• UVa/437_The_Tower_of_Babylon
• UVa/481_What_Goes_Up
• UVa/497_Strategic_Defense_Initiative

Shortest Path

• UVa/341_Non-Stop_Travel: Bellman-Ford
• UVa/558_Wormholes: Bellman-Ford
• UVa/10000_Longest_Paths: Bellman-Ford
• UVa/10048_Audiophobia: Floyd
• UVa/10278_Fire_Station: Floyd
• UVa/10986_Sending_email: SPFA

Articulation (Cut Vertex)

• UVa/315_Network
• UVa/10199_Tourist_Guide

SCC (Tarjan)

• UVa/11838_Come_and_Go
• UVa/247_Calling_Circles
• UVa/459_Graph_Connectivity
• UVa/11709_Trust_groups

MST

• UVa/10034_Freckles: Kruskal
• UVa/10397_Connect_the_Campus: Kruskal
• UVa/10147_Highways: Kruskal
• UVa/10600_ACM_contest_and_Blackout: Kruskal
• UVa/10842_Traffic_Flow: Kruskal, MaxST
• UVa/908_Re-connecting_Computer_Sites: Kruskal
• UVa/11710_Expensive_subway: Kruskal
• UVa/10369_Arctic_Network: Kruskal

KMP (Knuth-Morris-Pratt)

• UVa/455_Periodic_Strings
• UVa/10298_Power_Strings
• UVa/11475_Extend_to_Palindromes

Maximum Flow

• UVa/820_Internet_Bandwidth: Ford Fulkerson
• UVa/10330_Power_Transmission: Ford Fulkerson
• UVa/10779_Collectors_Problem: Ford Fulkerson
• UVa/11418_Clever_Naming_Patterns: Edmonds Karp

Bipartite Matching (Augmenting Path)

• UVa/10080_Gopher_II
• UVa/(POJ)2536_Gopher_II
• UVa/259_Software_Allocation
• UVa/663_Sorting_Slides
• UVa/1486_Sorting_Slides
• UVa/670_The_dog_task
• UVa/1325_Machine_Schedule
• UVa/(POJ)1194_Machine_Schedule
• UVa/11159_Factors_and_Multiples
• leetcode/886-possible-bipartition

Segment Tree

• UVa/(POJ)3264_Balanced_Lineup

Binary Indexed Tree

• UVa/(POJ)2352_Stars
• UVa/(POJ)1195_Mobile_phones: 2D
• UVa/(POJ)3321_Apple_Tree
• UVa/11423_Cache_Simulator
• UVa/(POJ)2155_Matrix: 2D
• UVa/(POJ)3067_Japan
• UVa/(POJ)2481_Cows

Line Intersection

• UVa/191_Intersection
• UVa/378_Intersecting_Lines

Convex Hull

• UVa/218_Moth_Eradication
• UVa/681_Convex_Hull_Finding