Problem List

上課影片

連結

• Problem List
  • 上課影片
  • Greedy and Sorting
  • Binary Search
  • Ternary search
  • Tree
    • basic
  • Graph
    • graph traversal
    • DAG+DP
    • floyd
    • dijkstra
  • topological sort
  • Union-find (Disjoint Set)
  • Segment-tree
  • Binary Indexed Tree(Fenwick Tree)
  • trie
  • prime
  • DP
  • Digit-DP
  • 單調隊列優化
  • meet in the middle
  • brute force
  • exponentiating by squaring
  • classic problems

複製勾勾：✓

Greedy and Sorting

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Dandanjudge a071	✓				✓			✓
Dandanjudge a073
Dandanjudge a074
Dandanjudge a075								✓
Dandanjudge a076								✓
Dandanjudge a078
Dandanjudge a079
Dandanjudge a080
Dandanjudge a081
Zerojudge b606								✓
Zerojudge b231
Zerojudge c471								✓

Binary Search

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge d732								✓
Zerojudge c575								✓
Zerojudge c942								✓
Dandanjudge a120
Dandanjudge a121
Dandanjudge a122
Codeforces 1251D
Codeforces 1436C

Ternary search

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
SPOJ KOPC12A
Codeforces 578C
Codeforces 1355E
Codeforces 1301B

Tree

basic

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
dandanjudge a144								✓

Graph

graph traversal

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge b108								✓
Zerojudge a584
Zerojudge a586
CodeForces 1037D								✓

DAG+DP

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Codeforces gym101667C

floyd

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Hacker-cup 2020 qualification A
SPOJ SOCIALNE
CodeForces 295B

dijkstra

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Dandanjudge a308								✓

topological sort

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
UVa 10305
UVa 200
UVa 124
gym100274 pC
gym102058 pA

Union-find (Disjoint Set)

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge a445
CodeForces 1263D
CodeForces 1139C(with math)

Segment-tree

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge d668
Zerojudge f315
CodeForces 1440E

Binary Indexed Tree(Fenwick Tree)

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge e406
Zerojudge d542
Zerojudge d847
Zerojudge d796
Atcoder abc185_f

trie

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge d518
Uva 644
Codeforces 1285D

prime

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge a007								✓

DP

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	aod571431	peterlee
Dandanjudge a493
Dandanjudge a145
Zerojudge a587
Zerojudge b942
Zerojudge d784
Zerojudge d378

Digit-DP

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
HDU 3555
HDU 2089
Codeforces 102452J

單調隊列優化

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge c528
Zerojudge a146
Codeforces 1077F2

meet in the middle

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge c927
SPOJ SUBSUMS
Codeforces 327E

brute force

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
codechef DGMATRIX 10%

exponentiating by squaring

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge d636
Codeforces 450B

classic problems

Problem Link	ccbeginner	NnAracy	a0908	D	Eric	MingHao	G	arod571431	peterlee
Zerojudge a129(MST)

void dijkstra(int s){
    dis.clear();dis.resize(n,INF);
    v.clear();v.resize(n,0);
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
    
    dis[s]=0;
    pq.push(make_pair(dis[s],s));

    while(!pq.empty()){
        pair<int,int> u=pq.pop();
        pq.pop();
        if(v[u.second]) continue;
        v[u.second]=1;

        for(int i=0;i<edge[u.second];i++){
            int to=edge[u.second][i].first;
            int w=edge[u.second][i].second;
            if(dis[to] > u.first + w ){
                dis[to] = u.first+w;
                pq.push(make_pair(dis[to],to));
            }
        }
    }
}