Jtopcoder/notes.txt at master · arshdeep/Jtopcoder · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
//dp recepie links
http://apps.topcoder.com/forums/?module=Thread&threadID=697369&start=0
http://apps.topcoder.com/forums/?module=Thread&threadID=700080&start=0
http://apps.topcoder.com/forums/?module=Thread&threadID=697925&start=0

ALL ( bfs nice hard implementation )
ACODE ( dp medium )
ACMAKER ( dp hard )
AIBOHP ( dp medium )

BABTWR ( easy LIS (i think) )
BABY( hard DP, bitmasks )
CERC07B ( bitmasks same as DFLOOR )
CERC07K ( bfs nice state )
CHMAZE ( BFS nice state )
CRSCNTRY ( dp very easy )
CZ_PROB1 ( dp easy )
DEPEND ( topological sort )
CLEANRBT ( BFS then DP, hard )
DFLOOR ( same as CERC07B )
FCANDY ( DP weak test data assume difference doesnt exceed 200 )
GEORGE ( dijkstra nice )
GNY07H ( dp bitmask tricky harder version of BYTESH1, M3TILE )
GORELIAN ( bfs hard on implementation )
IMAGE ( flood fill add up 4 - neighbours for each cell )
HS08PAUL ( number theory easy )
HELPBOB ( dp bitmask )
HIST2  ( dp bitmask )
M3TILE ( dp bitmask harder version of BYTESH1 )
MAWORK ( bfs good state )
MBLAST ( dp easy )
MELE3 ( dijkstra )
MICEMAZE ( dijkstra / bfs )
MINVEST ( dp knapsack medium )
MBEEWALK ( dp different dx, dy )
MCOINS ( very easy DP )
MCIRGAME (big int dp catalan numbers (google it) )
MENU ( medium dp )
MIXTURES ( medium dp, see matrix chain multiplication CLRS )
MKBUDGET ( easy dp )

MLASERP ( BFS normal )
MMAXPER ( dp easy )
MMINPAID ( dp / bfs bitmask )
MNERED ( dp )
MONODIG ( bfs hard )
MORSE ( dp medium )
MPILOT ( dp easy )
MREPLBRC ( dp v.hard )
MSTRING ( dp medium )
NOCHANGE ( dp hard )
NOTATRI ( binary search )
PARTY ( dp easy )
PHIDIAS ( dp easy )
PATHEADS ( concept of bucket sort and sieve )
PIE ( binary search easy )
PIGBANK ( dp easy ugly optimisations needed )
PIZZALOC ( bitmasks easy )
QUEEN ( hard bfs )
RAIN3 ( dp easy )
RAINBOW ( dp knapsack on components easy )
REMGAME ( recursion memoisation easy weak test data )
RENT ( dp binary search (to convert n^2 to nlogn )
ROCK ( easy dp )
SAMER08A ( 3 dijkstras basic graph theory )
SAMER08C ( dp medium )
SAMER08D ( dp hard )
SCUBADIV ( dp easy )
SQRBR ( dp easy )
SQFREE ( number theory sieve hard inclusion exclusion )
STREET ( dp hard )
SUBSUMS ( bitmasks binary search )
SUMFOUR ( binary search easy )
SVADA ( binary search hard )
TEMPTISL ( dp easy )
TRAFFICN ( dijkstra easy basic graph theory )
TRSTAGE ( dijkstra bitmasks medium )
UPSUB ( dp LIS )
YODA ( dp easy )
ODDDIV ( number theory precomputation fast IO )


New problems
ABCDEF ( binary search )
ANARC07G ( dp )
ANARC07C ( simulation medium )
ANARC05H ( dp )
ANARC05B ( dp binary search )
ANARC08H ( josephsus problem )
ANARC08G ( elementary graph theory )
ANARC08F ( shortest path )
ANARC08E ( dp )
ANARC08B ( ad-hoc stupid )
UCI2009B ( number theory easy )

Others
SVADA (binary search hard)
MKUHAR ( simple math binary search hard )
MLAND (kruskals ternary search)
MPOLY (geometry ternary search)
MONODIG (bfs hard)
MSE06H (BIT easy)
MZVRK (adhoc easy)
PDECODE (permutation exponentiation)
PLHOP (matrix exponentiation)
PON (miller rabin primality testing)
PRO (set)
QUEEN (bfs hard)
RATING (bit)
MCHAOS (bit)
SCALE (brute force binary search)
WIJGT (geometry dfs)
THREECOL (dp)
MTOTALF (maxflow easy)