Merge pull request #509 from xirc/atcoder/abc185

AtCoder/ABC185

Author: xirc

atcoder/abc185/A/main.cpp

@@ -0,0 +1,17 @@
+#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 A, B, C, D;
+    cin >> A >> B >> C >> D;
+    int N = min({ A, B, C, D });
+    cout << N << endl;
+
+    return 0;
+}

atcoder/abc185/B/main.cpp

@@ -0,0 +1,38 @@
+#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, M, T;
+    cin >> N >> M >> T;
+
+    bool success = true;
+    int time = 0;
+    int remaining = N;
+    for (int mm = 0; mm < M; ++mm) {
+        int A, B;
+        cin >> A >> B;
+        int consumed = A - time;
+        remaining -= consumed;
+        if (remaining <= 0) {
+            success = false;
+            break;
+        }
+        int charged = B - A;
+        remaining += charged;
+        remaining = min(remaining, N);
+        time = B;
+    }
+    int consumed = T - time;
+    remaining -= consumed;
+    if (remaining <= 0) success = false;
+
+    cout << (success ? "Yes" : "No") << endl;
+
+    return 0;
+}

atcoder/abc185/C/main.cpp

@@ -0,0 +1,22 @@
+#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 L;
+    cin >> L;
+
+    ll ans = 1;
+    for (int i = 1; i <= 11; ++i) {
+        ans *= L- i;
+        ans /= i;
+    }
+    cout << ans << endl;
+
+    return 0;
+}

atcoder/abc185/D/main.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N, M;
+vector<int> A;
+
+int solve() {
+    A.push_back(0);
+    A.push_back(N + 1);
+    sort(A.begin(), A.end());
+
+    int w = N;
+    for (int i = 0; i + 1 < A.size(); ++i) {
+        int space = A[i+1] - A[i] - 1;
+        if (space > 0) {
+            w = min(w, space);
+        }
+    }
+
+    int ans = 0;
+    for (int i = 0; i + 1 < A.size(); ++i) {
+        int space = A[i+1] - A[i] - 1;
+        ans += (space + w - 1) / w;
+    }
+    return ans;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N >> M;
+    A.assign(M, 0);
+    for (auto &a : A) cin >> a;
+    cout << solve() << endl;
+
+    return 0;
+}