gitignore and some dp

Author: ax3ghazy

.gitignore

@@ -7,3 +7,7 @@ gen
 check
 a.out
 *.pdf
+GTAGS
+GRTAGS
+GPATH
+\#*

uva/10684/10684.cpp

@@ -0,0 +1,59 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define infint 0x7fffffff // 32-bit int
+#define ninfint 0x80000000
+#define EPS 1e-9
+#define mp(A, B) make_pair(A, B)
+#define sdf(n) scanf("%d", &n)
+#define ssf(a) scanf(" %s ", a)
+#define pdf(n) printf("%d", n)
+#define pcf(c) printf("%c", c)
+#define pdfn(n) printf("%d\n", n)
+#define pb push_back
+#define pendl() printf("\n")
+
+#define isOn(S, j) (S & (1 << j))
+#define setBit(S, j) (S |= (1 << j))
+#define clearBit(S, j) (S &= ~(1 << j))
+#define toggleBit(S, j) (S ^= (1 << j))
+#define lowBit(S) (S & (-S))
+#define setAll(S, n) (S = (1 << n) - 1)
+#define pque priority_queue
+
+typedef long long ll;
+typedef pair<int, int> ii;
+typedef pair<int, ii> iii;
+typedef vector<int> vi;
+typedef vector<ii> vii;
+typedef vector<iii> viii;
+
+#define endl '\n'
+
+int N;
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  while (cin >> N, N) {
+    int sum = 0, soln = 0;
+    while (N--) {
+      int a;
+      cin >> a;
+      if (sum + a >= 0) {
+        sum += a;
+      } else {
+        sum = 0;
+      }
+      soln = max(soln, sum);
+    }
+    if (sum == 0) {
+      cout << "Losing streak.";
+    } else {
+      cout << "The maximum winning streak is " << soln << ".";
+    }
+    cout << endl;
+  }
+  return 0;
+}

uva/11450/11450_bottomup_optimized.cpp

@@ -0,0 +1,105 @@
+#include <iostream>
+#include <iomanip>
+#include <sstream>
+#include <bitset>
+#include <cstdio>
+#include <ctime>
+#include <chrono> //C++11
+#include <algorithm>
+#include <map>
+#include <utility>
+#include <set>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <list>
+#include <string>
+#include <cstring>
+#include <cctype>
+#include <climits>
+#include <cmath>
+#include <functional>
+#include <cstring>
+using namespace std;
+
+#define inf 0x7fffffff //32-bit int
+#define ninf 0x80000000
+#define mp(A,B) make_pair(A,B)
+#define sdf(n) scanf("%d",&n)
+#define ssf(a) scanf(" %s ", a)
+#define pdf(n) printf("%d",n)
+#define pcf(c) printf("%c",c)
+#define pdfn(n) printf("%d\n",n)
+#define pb push_back
+#define pendl() printf("\n")
+
+#define isOn(S, j) (S & (1 << j))
+#define setBit(S, j) (S |= (1 << j))
+#define clearBit(S, j) (S &= ~(1 << j))
+#define toggleBit(S, j) (S ^= (1 << j))
+#define lowBit(S) (S & (-S))
+#define setAll(S, n) (S = (1 << n) - 1)
+
+//typedef later
+#define ii pair<int,int>
+#define iii pair<int,ii>
+typedef vector<int> vi;
+#define vii vector<ii>
+#define viii vector<iii>
+#define pque priority_queue
+
+int G, M, modelPrices[25][25];
+bool dp[2][205];
+int prv, cur;
+
+void solve() {
+    for (int model = 1; model <= modelPrices[0][0]; model++) {
+        int price = modelPrices[0][model];
+        if (M - price >= 0) {
+            dp[prv][M-price] = true;
+        }
+    }
+    for (int g = 1; g < G; g++) {
+        for (int m = 0; m <= M; m++) {
+            dp[cur][m] = false;
+            if (dp[prv][m] == true) {
+                for (int model = 1; model <= modelPrices[g][0]; model++) {
+                    int price = modelPrices[g][model];
+                    if (m - price >= 0) {
+                        dp[cur][m-price] = true;
+                    }
+                }
+            }
+        }
+        swap(prv, cur);
+    }
+}
+
+int main() {
+	ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+	int T; cin >> T;
+	while (T--) {
+        memset(dp, false, 205);
+		cin >> M >> G;
+        prv = 0, cur = 1;
+		for (int i = 0; i < G; i++) {
+			int K; cin >> K;
+			modelPrices[i][0] = K;
+			for (int j = 1; j <= K; j++)
+				cin >> modelPrices[i][j];
+		}
+        solve();
+		int m;
+        for (m = 0; m <= M && !dp[prv][m]; m++);
+
+		if (m == M+1)
+			cout << "no solution";
+		else
+			cout << M-m;
+		cout << endl;
+	}
+
+	return 0;
+}
+

uva/WeddingShopping11450.cpp renamed to uva/11450/11450_topdown.cpp

@@ -0,0 +1,71 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+#define infint 0x7fffffff //32-bit int
+#define ninfint 0x80000000
+#define EPS 1e-9
+#define mp(A,B) make_pair(A,B)
+#define sdf(n) scanf("%d",&n)
+#define ssf(a) scanf(" %s ", a)
+#define pdf(n) printf("%d",n)
+#define pcf(c) printf("%c",c)
+#define pdfn(n) printf("%d\n",n)
+#define pb push_back
+#define pendl() printf("\n")
+
+#define isOn(S, j) (S & (1 << j))
+#define setBit(S, j) (S |= (1 << j))
+#define clearBit(S, j) (S &= ~(1 << j))
+#define toggleBit(S, j) (S ^= (1 << j))
+#define lowBit(S) (S & (-S))
+#define setAll(S, n) (S = (1 << n) - 1)
+#define pque priority_queue 
+
+typedef long long ll;
+typedef pair<int,int> ii;
+typedef pair<int,ii> iii;
+typedef vector<int> vi;
+typedef vector<ii> vii;
+typedef vector<iii> viii;
+
+#define endl '\n'
+int route[20005], S, b;
+
+void solve(int r) {
+  int sum = 0, soln = 0, s = 1, solns, solne;
+  for (int e = 1; e <= S-1; ++e) {
+    int a = route[e];
+    if (sum + a >= 0) {
+      sum += a;
+    } else {
+      sum = 0;
+      s = e+1;
+    }
+    if ((sum > soln) || (sum == soln && e-s > solne-solns)) {
+      soln = sum;
+      solns = s, solne = e;
+    }
+  }
+  if (soln != 0) {
+    cout << "The nicest part of route " << r << " is between stops " << solns
+         << " and " << solne+1 << endl;
+  } else {
+    cout << "Route " << r << " has no nice parts" << endl;
+  }
+}
+
+
+int main(){
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cin >> b;
+    for (int r = 1; r <= b; r++){
+      cin >> S;
+      for (int i = 1; i <= S-1; ++i) {
+        cin >> route[i];
+      }
+      solve(r);
+    }
+
+    return 0;
+}