[atcoder] Add abc D

Author: nojima

atcoder/abc122/D.cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <vector>
+#include <string>
+using namespace std;
+
+const long long MOD = 1'000'000'000 + 9;
+
+long long power(long long m, long long n) {
+    long long ret = 1;
+    for (int i = 0; i < n; ++i)
+        ret = (ret * m) % MOD;
+    return ret;
+}
+
+int main() {
+    int N;
+    while (cin >> N) {
+        vector<string> forbidden = {"AGC", "ACG", "GAC", "ATGC", "AGGC", "AGTC"};
+        long long ans = 0;
+        for (int S = 1; S < (1 << forbidden.size()); ++S) {
+            int len = 0;
+            for (int i = 0; i < (int)forbidden.size(); ++i) {
+                if ((S >> i) & 1) {
+                    len += forbidden[i].length();
+                }
+            }
+            if (N - len >= 0) {
+                long long pattern = power(4, N - len) * (N - len + 1) % MOD;
+                if (S == 3) {
+                    // GACG
+                    pattern = (pattern + MOD - power(4, N - 4)) % MOD;
+                }
+                cout << "pattern=" << pattern << endl;
+                if (__builtin_popcount(S) % 2 == 1) {
+                    ans = (ans + pattern) % MOD;
+                } else {
+                    ans = (ans - pattern + MOD) % MOD;
+                }
+            }
+        }
+        long long all = power(4, N);
+        cout << (all - ans + MOD) % MOD << endl;
+    }
+}

atcoder/abc122/D.in

@@ -0,0 +1,3 @@
+3
+4
+100

atcoder/abc123/D.cpp

@@ -0,0 +1,30 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <functional>
+using namespace std;
+
+#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
+
+int main() {
+    int X, Y, Z, K;
+    while (cin >> X >> Y >> Z >> K) {
+        vector<long long> A(X), B(Y), C(Z);
+        REP(i, X) cin >> A[i];
+        REP(i, Y) cin >> B[i];
+        REP(i, Z) cin >> C[i];
+        sort(A.begin(), A.end(), greater<long long>());
+
+        vector<long long> BC;
+        REP(y, Y) REP(z, Z) BC.push_back(B[y] + C[z]);
+        sort(BC.begin(), BC.end(), greater<long long>());
+
+        vector<long long> ABC;
+        REP(x, X) REP(k, min(K, (int)BC.size())) {
+            ABC.push_back(A[x] + BC[k]);
+        }
+        sort(ABC.begin(), ABC.end(), greater<long long>());
+
+        REP(k, K) cout << ABC[k] << '\n';
+    }
+}

atcoder/abc123/D.in

@@ -0,0 +1,14 @@
+2 2 2 8
+4 6
+1 5
+3 8
+
+3 3 3 5
+1 10 100
+2 20 200
+1 10 100
+
+10 10 10 20
+7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488
+1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338
+4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736

atcoder/abc124/D.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <string>
+using namespace std;
+
+int main() {
+    int N, K;
+    while (cin >> N >> K) {
+        string S; cin >> S;
+        vector<int> n_segment(N);
+        bool in_segment = (S[0] == '0');
+        n_segment[0] = (S[0] == '0');
+        for (int i = 1; i < N; ++i) {
+            if (S[i] == '0') {
+                n_segment[i] = n_segment[i-1] + (in_segment ? 0 : 1);
+                in_segment = true;
+            } else {
+                n_segment[i] = n_segment[i-1];
+                in_segment = false;
+            }
+        }
+        int answer = 0;
+        for (int i = 0; i < N; ++i) {
+            int limit = K + n_segment[i] + (S[i] == '0' ? -1 : 0);
+            auto it = upper_bound(n_segment.begin() + i, n_segment.end(), limit);
+            int len = it - (n_segment.begin() + i);
+            answer = max(answer, len);
+        }
+        cout << answer << endl;
+    }
+}

atcoder/abc124/D.in

@@ -0,0 +1,11 @@
+5 1
+00010
+
+14 2
+11101010110011
+
+1 1
+1
+
+12 1
+110001100011

atcoder/abc125/D.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
+
+int main() {
+    int N;
+    while (cin >> N) {
+        vector<long long> A(N);
+        REP(i, N) {
+            cin >> A[i];
+        }
+
+        vector<vector<long long>> dp(N, vector<long long>(2));
+        dp[0][0] = A[0];
+        dp[0][1] = -1e12;
+        for (int i = 1; i < N; ++i) {
+            // -1 倍しない場合
+            dp[i][0] = A[i] + max(dp[i-1][0], dp[i-1][1]);
+            // -1 倍する場合
+            dp[i][1] = -A[i] + max(dp[i-1][0] - 2*A[i-1], dp[i-1][1] + 2*A[i-1]);
+        }
+
+        cout << max(dp[N-1][0], dp[N-1][1]) << endl;
+    }
+}

atcoder/abc125/D.in

@@ -0,0 +1,8 @@
+3
+-10 5 -4
+
+5
+10 -4 -8 -11 3
+
+11
+-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000