No commit message

myCpps/!-OJcreater.cpp

@@ -12,7 +12,7 @@
 using namespace std;
 
 //***************************************
-const string CPPfile = "almostShortestPath_UVA12144"; //*
+const string CPPfile = "copyingBooks_UVA714"; //*
 //***************************************
 
 ifstream fin(CPPfile + ".cpp");

myCpps/aGroupingProblem_UVA11026.cpp

@@ -9,27 +9,10 @@ int main()
 {
     while (true)
     {
-        int n = 0, m = 0; fin >> n >> m;
+        long long n = 0, m = 0; fin >> n >> m;
         if (n + m == 0) break;
 
-        long long sum = 0, ans = -1;
-        vector<long long> a(n, 0), dp(n + 1, 0);
-
-        for (int i = 0; i <= n - 1; ++i)
-        {
-            fin >> a[i];
-
-            sum += (a[i] * a[i]);
-            dp[1] += a[i];
-        }
-
-        ans = max(ans, dp[1] % m);
-        for (int k = 2; k <= n; ++k)
-        {
-
-
-            ans = max(ans, dp[k] % m);
-        }
+
     }
 
     return 0;

myCpps/aGroupingProblem_UVA11026.in

@@ -0,0 +1,7 @@
+4 10
+1 2 3 4
+4 100
+1 2 3 4
+4 6
+1 2 3 4
+0 0

myCpps/copyingBooks_UVA714.cpp

@@ -0,0 +1,90 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+ifstream fin("copyingBooks_UVA714.in");
+ofstream fout("copyingBooks_UVA714.out");
+
+int main()
+{
+    long long testCase; fin >> testCase;
+    for (long long t = 1; t <= testCase; ++t)
+    {
+        long long m, k; fin >> m >> k;
+
+        long long l = 0, r = 0;
+        vector<long long> a(m);
+        for (long long i = 0; i <= m - 1; ++i)
+        {
+            fin >> a[i];
+
+            r += a[i];
+        }
+
+        set<long long> s;
+        while (l <= r)
+        {
+            long long mid = (l + r) / 2,
+                      kc = k, i = m - 1,
+                      now = 0;
+            s.clear();
+
+            while (kc >= 1)
+            {
+                if (kc == 1)
+                {
+                    while (i >= 0)
+                    {
+                       now += a[i];
+                        --i;
+                    }
+                    break;
+                }
+                else if (i < kc - 1)
+                {
+                    now = 0;
+                    s.insert(i + 1);
+                    --kc;
+                }
+                else if (now + a[i] > mid)
+                {
+                    now = 0;
+                    s.insert(i + 1);
+                    --kc;
+                }
+                else
+                {
+                    now += a[i];
+                    --i;
+                }
+            }
+
+            if (now <= mid)
+            {
+                if (r == mid) break;
+                r = mid;
+            }
+            else
+            {
+                l = mid + 1;
+            }
+        }
+
+        vector<long long> fence_bool(m, 0);
+        for (auto it = s.begin(); it != s.end(); ++it)
+        {
+            long long pos = *it;
+            fence_bool[pos] = 1;
+        }
+
+        for (long long i = 0; i <= m - 1; ++i)
+        {
+            if (fence_bool[i] == 1) fout << " /";
+            if (i > 0) fout << ' ';
+            fout << a[i];
+        }
+        fout << '\n';
+    }
+
+    return 0;
+}

myCpps/copyingBooks_UVA714.in

@@ -0,0 +1,5 @@
+2
+9 3
+100 200 300 400 500 600 700 800 900
+5 4
+100 100 100 100 100

myCpps/copyingBooks_UVA714.out

@@ -0,0 +1,2 @@
+100 200 300 400 500 / 600 700 / 800 900
+100 / 100 / 100 / 100 100

myCpps/copyingBooks_UVA714OJ.cpp

@@ -0,0 +1,92 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+
+int main()
+{
+	ios_base::sync_with_stdio(false);
+	std::cin.tie(NULL);
+    long long testCase; cin >> testCase;
+    for (long long t = 1; t <= testCase; ++t)
+    {
+        long long m, k; cin >> m >> k;
+
+        long long l = 0, r = 0;
+        vector<long long> a(m);
+        for (long long i = 0; i <= m - 1; ++i)
+        {
+            cin >> a[i];
+
+            r += a[i];
+        }
+
+        set<long long> s;
+        while (l <= r)
+        {
+            long long mid = (l + r) / 2,
+                      kc = k, i = m - 1,
+                      now = 0;
+            s.clear();
+
+            while (kc >= 1)
+            {
+                if (kc == 1)
+                {
+                    while (i >= 0)
+                    {
+                       now += a[i];
+                        --i;
+                    }
+                    break;
+                }
+                else if (i < kc - 1)
+                {
+                    now = 0;
+                    s.insert(i + 1);
+                    --kc;
+                }
+                else if (now + a[i] > mid)
+                {
+                    now = 0;
+                    s.insert(i + 1);
+                    --kc;
+                }
+                else
+                {
+                    now += a[i];
+                    --i;
+                }
+            }
+
+            if (now <= mid)
+            {
+                if (r == mid) break;
+                r = mid;
+            }
+            else
+            {
+                l = mid + 1;
+            }
+        }
+
+        vector<long long> fence_bool(m, 0);
+        for (auto it = s.begin(); it != s.end(); ++it)
+        {
+            long long pos = *it;
+            fence_bool[pos] = 1;
+        }
+
+        for (long long i = 0; i <= m - 1; ++i)
+        {
+            if (fence_bool[i] == 1) cout << " /";
+            if (i > 0) cout << ' ';
+            cout << a[i];
+        }
+        cout << '\n';
+    }
+
+   	cout.flush();
+   	return 0;
+}
+