Merge pull request #506 from xirc/atcoder/abc181

AtCoder/ABC181

Author: xirc

atcoder/abc181/A/main.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int N;
+    cin >> N;
+    
+    auto color = (N % 2 == 0) ? "White" : "Black";
+    cout << color << endl;
+
+    return 0;
+}

atcoder/abc181/B/main.cpp

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int N;
+
+    cin >> N;
+
+    ll sum = 0;
+    for (int i = 0; i < N; ++i) {
+        int A, B;
+        cin >> A >> B;
+        sum += ll(A + B) * (B - A + 1) / 2;
+    }
+    cout << sum << endl;
+
+    return 0;
+}

atcoder/abc181/C/main.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N;
+vector<int> xs, ys;
+
+bool solve() {
+    for (int i = 0; i < N; ++i) {
+        for (int j = 0; j < N; ++j) {
+            if (i == j) continue;
+            for (int k = 0; k < N; ++k) {
+                if (k == i || k == j) continue;
+                int lhs = (ys[j] - ys[i]) * (xs[k] - xs[j]);
+                int rhs = (ys[k] - ys[j]) * (xs[j] - xs[i]);
+                if (lhs == rhs) return true;
+            }
+        }
+    }
+    return false;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N;
+    xs.assign(N, 0);
+    ys.assign(N, 0);
+    for (int i = 0; i < N; ++i) {
+        cin >> xs[i] >> ys[i];
+    }
+
+    auto ans = solve() ? "Yes" : "No";
+    cout << ans << endl;
+
+    return 0;
+}

atcoder/abc181/D/main.cpp

@@ -0,0 +1,55 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+bool solve(string const& S) {
+    vector<int> count(10, 0);
+    for (auto c : S) {
+        int i = c - '0';
+        count[i] = min(3, count[i]+1);
+    }
+
+    vector<int> xs;
+    for (int i = 0; i < 10; ++i) {
+        while (count[i] > 0) {
+            xs.push_back(i);
+            --count[i];
+        }
+    }
+
+    int const M = xs.size();
+    assert(M >= 1);
+    if (M == 1) {
+        return xs[0] % 8 == 0;
+    }
+    if (M == 2) {
+        int s1 = xs[0] * 10 + xs[1];
+        int s2 = xs[1] * 10 + xs[0];
+        return (s1 % 8 == 0 || s2 % 8 == 0);
+    }
+    for (int i = 0; i < M; ++i) {
+        for (int j = 0 ; j < M; ++j) {
+            if (i == j) continue;
+            for (int k = 0; k < M; ++k) {
+                if (k == i || k == j) continue;
+                int s = xs[i] * 100 + xs[j] * 10 + xs[k];
+                if (s % 8 == 0) return true;
+            }
+        }
+    }
+    return false;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    string S;
+    cin >> S;
+    auto ans = solve(S) ? "Yes" : "No";
+    cout << ans << endl;
+
+    return 0;
+}

atcoder/abc181/E/main.cpp

@@ -0,0 +1,57 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N, M;
+vector<int> H;
+vector<int> W;
+
+ll solve() {
+    sort(H.begin(), H.end());
+    sort(W.begin(), W.end());
+    W.erase(unique(W.begin(), W.end()), W.end());
+
+    vector<ll> L(N, 0), R(N, 0);
+    for (int i = 1; i < N; i += 2) {
+        L[i] = (i-2 > 0) ? L[i-2] : 0;
+        L[i] += H[i] - H[i-1];
+    }
+    for (int i = N - 2; i >= 0; i -= 2) {
+        R[i] = (i+2 < N) ? R[i+2] : 0;
+        R[i] += H[i+1] - H[i];
+    }
+
+    ll ans = numeric_limits<ll>::max();
+    for (int i = 0; i < N; i += 2) {
+        ll ls = (i-1 >= 0) ? L[i-1] : 0;
+        ll rs = (i+1 < N) ? R[i+1] : 0;
+        auto lb = lower_bound(W.begin(), W.end(), H[i]);
+        if (lb != W.end()) {
+            ans = min(ans, ls + rs + (*lb - H[i]));
+        }
+        auto ub = upper_bound(W.begin(), W.end(), H[i]);
+        if (ub != W.begin()) {
+            --ub;
+            ans = min(ans, ls + rs + (H[i] - *ub));
+        }
+    }
+
+    return ans;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N >> M;
+
+    H.assign(N, 0);
+    for (auto &h : H) cin >> h;
+    W.assign(M, 0);
+    for (auto &w : W) cin >> w;
+    cout << solve() << endl;
+
+    return 0;
+}