add Appendix E

Author: encrypted-def

0x15/solutions/1351.cpp

@@ -0,0 +1,51 @@
+// Authored by : BaaaaaaaaaaarkingDog
+// Co-authored by : -
+// http://boj.kr/643416ff30264d9fb1290fb046114b8c
+#include <bits/stdc++.h>
+using namespace std;
+
+int n, k, w;
+int a[1005];
+int d[1005];
+vector<int> adj[1005];
+
+int go(int x){
+  if(d[x] != -1)
+    return d[x];
+  
+  d[x] = 0;
+  for(int nxt : adj[x])
+    d[x] = max(d[x], go(nxt));
+  
+  return d[x] = d[x] + a[x];
+}
+
+int main(){
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+
+  fill(d, d+1001, -1);
+  int t;
+  cin >> t;
+  while(t--){
+    cin >> n >> k;
+    for(int i = 1; i <= n; i++)
+      cin >> a[i];
+    while(k--){
+      int u, v;
+      cin >> u >> v;
+      adj[v].push_back(u);
+    }
+    cin >> w;
+    cout << go(w) << '\n';
+
+    fill(d, d+n+1, -1);
+    for(int i = 1; i <= n; i++)
+      adj[i].clear();
+  }
+}
+
+/*
+top-down 방식을 이용한 코드. 자세한 설명은
+Appendix E - 다이나믹 프로그래밍 심화 강의 참고.
+*/

0x1A/solutions/1005_1.cpp

@@ -0,0 +1,44 @@
+// http://boj.kr/643416ff30264d9fb1290fb046114b8c
+#include <bits/stdc++.h>
+using namespace std;
+
+int n, k, w;
+int a[1005];
+int d[1005];
+vector<int> adj[1005];
+
+int go(int x){
+  if(d[x] != -1)
+    return d[x];
+  
+  d[x] = 0;
+  for(int nxt : adj[x])
+    d[x] = max(d[x], go(nxt));
+  
+  return d[x] = d[x] + a[x];
+}
+
+int main(){
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+
+  fill(d, d+1001, -1);
+  int t;
+  cin >> t;
+  while(t--){
+    cin >> n >> k;
+    for(int i = 1; i <= n; i++)
+      cin >> a[i];
+    while(k--){
+      int u, v;
+      cin >> u >> v;
+      adj[v].push_back(u);
+    }
+    cin >> w;
+    cout << go(w) << '\n';
+
+    fill(d, d+n+1, -1);
+    for(int i = 1; i <= n; i++)
+      adj[i].clear();
+  }
+}

Appendix E/1005.cpp

@@ -0,0 +1,46 @@
+// Authored by : BaaaaaaaaaaarkingDog
+// Co-authored by : -
+// http://boj.kr/643416ff30264d9fb1290fb046114b8c
+#include <bits/stdc++.h>
+using namespace std;
+
+int n, k, w;
+int a[1005];
+int d[1005];
+vector<int> adj[1005];
+
+int go(int x){
+  if(d[x] != -1)
+    return d[x];
+  
+  d[x] = 0;
+  for(int nxt : adj[x])
+    d[x] = max(d[x], go(nxt));
+  
+  return d[x] = d[x] + a[x];
+}
+
+int main(){
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+
+  fill(d, d+1001, -1);
+  int t;
+  cin >> t;
+  while(t--){
+    cin >> n >> k;
+    for(int i = 1; i <= n; i++)
+      cin >> a[i];
+    while(k--){
+      int u, v;
+      cin >> u >> v;
+      adj[v].push_back(u);
+    }
+    cin >> w;
+    cout << go(w) << '\n';
+
+    fill(d, d+n+1, -1);
+    for(int i = 1; i <= n; i++)
+      adj[i].clear();
+  }
+}

Appendix E/solutions/1005.cpp

@@ -0,0 +1,39 @@
+// Authored by : Hot6Mania
+// Co-authored by : -
+// http://boj.kr/2b8c4fa5fed849008ff86212e8be86b3
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int n;
+int a[2010], d[2010][2010];
+
+int main(void) {
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+
+  cin >> n;
+  for (int i = 1; i <= n; ++i) cin >> a[i];
+
+  for (int i = 1; i <= n; ++i) {
+    d[i][i] = 1;
+    if (a[i - 1] == a[i]) d[i - 1][i] = 1;
+  }
+
+  for (int gap = 2; gap < n; ++gap) {
+    for (int i = 1; i <= n - gap; ++i) {
+      int s = i, e = i + gap;
+      if (a[s] == a[e] && d[s + 1][e - 1]) d[s][e] = 1;
+    }
+  }
+
+  int t;
+  cin >> t;
+  while (t--) {
+    int s, e;
+    cin >> s >> e;
+    cout << d[s][e] << '\n';
+  }
+
+  return 0;
+}

Appendix E/solutions/10942.cpp

@@ -0,0 +1,28 @@
+// Authored by : Hot6Mania
+// Co-authored by : -
+// http://boj.kr/4464384189904471b2a6b8d65681bbd4
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int n, m;
+int a[1030][1030], d[1030][1030];
+
+int main(void){
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+  
+  cin >> n >> m;
+  for (int i = 1; i <= n; ++i){
+    for (int j = 1; j <= n; ++j){
+      cin >> a[i][j];
+      d[i][j] = d[i-1][j] + d[i][j-1] - d[i-1][j-1] + a[i][j];
+    }
+  }
+  
+  while(m--){
+    int x1, y1, x2, y2;
+    cin >> x1 >> y1 >> x2 >> y2;
+    cout << d[x2][y2] - d[x1-1][y2] - d[x2][y1-1] + d[x1-1][y1-1] << '\n';
+  }
+}

Appendix E/solutions/11660.cpp

@@ -0,0 +1,33 @@
+// Authored by : BaaaaaaaaaaarkingDog
+// Co-authored by : -
+// http://boj.kr/485b69efb085449ca4c64d848656498b
+#include <bits/stdc++.h>
+using namespace std;
+
+int n, k;
+int d[102][100002];
+int w[102];
+int v[102];
+
+int main(void) {
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+
+  cin >> n >> k;
+  for(int i = 0; i < n; i++)
+    cin >> w[i] >> v[i];
+  
+  for(int i = 0; i < n; i++){
+    for(int j = 1; j <= k; j++){
+      if(i-1 >= 0)
+        d[i][j] = d[i-1][j];
+      if(j-w[i] >= 0){
+        if(i-1 >= 0)
+          d[i][j] = max(d[i][j], d[i-1][j-w[i]] + v[i]);
+        else
+          d[i][j] = v[i];
+      }
+    }
+  }
+  cout << d[n-1][k];
+}

Appendix E/solutions/12865.cpp

@@ -0,0 +1,25 @@
+// Authored by : BaaaaaaaaaaarkingDog
+// Co-authored by : -
+// http://boj.kr/5a8c26a75fd7433da8b814fc477b0317
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+ll n, p, q;
+map<ll, ll> a;
+
+ll go(ll x){
+  if(a[x] != 0)
+    return a[x];
+  if(x == 0)
+    return a[x] = 1;
+  return a[x] = go(x/p) + go(x/q);
+}
+
+int main(void) {
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+
+  cin >> n >> p >> q;
+  cout << go(n);
+}

Appendix E/solutions/1351.cpp

@@ -0,0 +1,35 @@
+// Authored by : Hot6Mania
+// Co-authored by : -
+// http://boj.kr/659c5fb01df043f6997a1aabc8a36f1b
+#include <bits/stdc++.h>
+using namespace std;
+
+int dx[4] = {1,0,-1,0};
+int dy[4] = {0,1,0,-1};
+int n, m;
+int a[505][505], d[505][505];
+
+int func(int x, int y){
+  if(d[x][y] != -1) return d[x][y];
+  if(x == n - 1 && y == m - 1) return 1;
+  int &ret = d[x][y];
+  ret = 0;
+  for(int dir = 0; dir < 4; ++dir){
+    int nx = x + dx[dir];
+    int ny = y + dy[dir];
+    if(nx < 0 || nx >= n || ny < 0 || ny >= m) continue;
+    if(a[x][y] > a[nx][ny]) ret += func(nx, ny);
+  }
+  return ret;
+}
+
+int main(void){
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+  
+  cin >> n >> m;
+  for(int i = 0; i < n; ++i)
+    for(int j = 0; j < m; ++j)
+      cin >> a[i][j], d[i][j] = -1;
+  cout << func(0, 0);
+}

Appendix E/solutions/1520.cpp

@@ -0,0 +1,21 @@
+// Authored by : Hot6Mania
+// Co-authored by : -
+// http://boj.kr/56aaa902f66645c58a86798d210d1dd1
+#include <bits/stdc++.h>
+using namespace std;
+
+int n;
+int d[100010];
+
+int main(void){
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+  
+  cin >> n;
+  for(int i = 1; i <= n; ++i){
+    d[i] = i;
+    for(int j = 1; j * j <= i; ++j)
+      d[i] = min(d[i], d[i - j * j] + 1);
+  }
+  cout << d[n];
+}