Merge pull request #315 from xirc/atcoder/abc076

AtCoder/ABC076

Author: xirc

atcoder/abc076/A/main.cpp

@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = long long;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int R, G;
+    cin >> R >> G;
+    cout << (2 * G - R) << endl;
+
+    return 0;
+}

atcoder/abc076/B/main.cpp

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = long long;
+
+int solve(int N, int K) {
+    int v = 1;
+    for (int i = 0; i < N; ++i) {
+        int nv1 = v * 2, nv2 = v + K;
+        v = min(nv1, nv2);
+    }
+    return v;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int N, K;
+    cin >> N >> K;
+    cout << solve(N, K) << endl;
+
+    return 0;
+}

atcoder/abc076/C/main.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = long long;
+
+string const NOP = "UNRESTORABLE";
+string S, T;
+
+bool solve(vector<char>& W, int s) {
+    for (int i = 0; i < s; ++i) {
+        if (W[i] == '?') W[i] = 'a';
+    }
+    for (int i = 0; i < T.size(); ++i) {
+        if (W[s+i] == '?') {
+            W[s+i] = T[i];
+        }
+        if (W[s+i] != T[i]) return false;
+    }
+    for (int i = s + T.size(); i < S.size(); ++i) {
+        if (W[i] == '?') W[i] = 'a';
+    }
+    return true;
+}
+
+string solve() {
+    for (int i = S.size() - T.size(); i >= 0; --i) {
+        vector<char> W(S.begin(), S.end());
+        if (solve(W, i)) return string(W.begin(), W.end());
+    }
+    return NOP;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> S >> T;
+    cout << solve() << endl;
+
+    return 0;
+}

atcoder/abc076/D/main.cpp

@@ -0,0 +1,60 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = long long;
+
+int N;
+vector<int> ts;
+vector<int> vs;
+
+double solve() {
+    int T = 0;
+    vector<vector<int>> cs(N);
+    for (int i = 0; i < N; ++i) {
+        int l = T, r = T + ts[i], v = vs[i];
+        cs[i] = { l, r, v };
+        T += ts[i];
+    }
+    cs.push_back({ 0, 0, 0 });
+    cs.push_back({ T, T, 0 });
+    const auto minv = [&](double t) {
+        double res = 100;
+        for (auto const& c : cs) {
+            auto l = c[0], r = c[1], v = c[2];
+            if (t < l) {
+                res = min(res, v + (l - t));
+            } else if (t > r) {
+                res = min(res, v + (t - r));
+            } else {
+                res = min(res, double(v));
+            }
+        }
+        return res;
+    };
+
+    double S = 0;
+    for (int tt = 0; tt < 2 * T; ++tt) {
+        double t = tt * 0.5, nt = (tt + 1) * 0.5;
+        double v = minv(t), nv = minv(nt);
+        S += 0.5 * (v + nv) * 0.5;
+    }
+    return S;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N;
+    ts.assign(N, 0);
+    vs.assign(N, 0);
+    for (int i = 0; i < N; ++i) {
+        cin >> ts[i];
+    }
+    for (int i = 0; i < N; ++i) {
+        cin >> vs[i];
+    }
+    cout << fixed << setprecision(3) << solve() << endl;
+
+    return 0;
+}