Merge pull request #401 from xirc/atcoder/abc024

AtCoder/ABC024

Author: xirc

atcoder/abc024/A/main.cpp

@@ -0,0 +1,25 @@
+#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, K;
+    int S, T;
+
+    cin >> A >> B >> C >> K;
+    cin >> S >> T;
+
+    if (S + T >= K) {
+        A -= C;
+        B -= C;
+    }
+    int F = A * S + B * T;
+    cout << F << endl;
+
+    return 0;
+}

atcoder/abc024/B/main.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N, T;
+vector<int> A;
+
+int solve() {
+    int const M = 2e6;
+    vector<int> DP(M, 0);
+    for (int i = 0; i < N; ++i) {
+        DP[A[i]] += 1;
+        DP[A[i]+T] -= 1;
+    }
+    int ts = 0;
+    for (int i = 1; i < M; ++i) {
+        DP[i] += DP[i-1];
+    }
+    for (int i = 0; i < M; ++i) {
+        if (DP[i] > 0) ++ts;
+    }
+    return ts;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N >> T;
+    A.assign(N, 0);
+    for (int i = 0; i < N; ++i) {
+        cin >> A[i];
+    }
+    cout << solve() << endl;
+
+    return 0;
+}

atcoder/abc024/C/main.cpp

@@ -0,0 +1,51 @@
+#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, D, K;
+    vector<int> L, R;
+    vector<int> S, T;
+
+    cin >> N >> D >> K;
+    L.assign(D, 0);
+    R.assign(D, 0);
+    for (int i = 0; i < D; ++i) {
+        cin >> L[i] >> R[i];
+    }
+    S.assign(K, 0);
+    T.assign(K, 0);
+    for (int i = 0; i < K; ++i) {
+        cin >> S[i] >> T[i];
+    }
+
+    vector<int> arrived_day(K, 0);
+    vector<int> xs(K, 0);
+    for (int i = 0; i < K; ++i) {
+        xs[i] = S[i];
+    }
+    for (int i = 0; i < D; ++i) {
+        auto l = L[i], r = R[i];
+        for (int k = 0; k < K; ++k) {
+            if (arrived_day[k] > 0) continue;
+            if (S[k] < T[k] && l <= xs[k]) {
+                xs[k] = max(xs[k], min(r, T[k]));
+                if (xs[k] == T[k]) arrived_day[k] = i + 1;
+            }
+            if (S[k] > T[k] && xs[k] <= r) {
+                xs[k] = min(xs[k], max(l, T[k]));
+                if (xs[k] == T[k]) arrived_day[k] = i + 1;
+            }
+        }
+    }
+    for (int k = 0; k < K; ++k) {
+        cout << arrived_day[k] << endl;
+    }
+
+    return 0;
+}

atcoder/abc024/D/main.cpp

@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+
+inline int64_t extgcd(
+    int64_t const a,
+    int64_t const b,
+    int64_t &x, int64_t &y
+)
+{
+    if (b == 0) {
+        x = 1, y = 0;
+        return a;
+    }
+    int64_t x1, y1;
+    int64_t g = extgcd(b, a % b, x1, y1);
+    x = y1;
+    y = x1 - y1 * (a / b);
+    return g;
+}
+
+inline int64_t modinv(int64_t a, int64_t m) {
+    int64_t x, y;
+    int64_t g;
+    g = extgcd(a, m, x, y);
+    if (g != 1) {
+        // There are no modular multiplicative inverse
+        return -1;
+    }
+    return (x % m + m) % m;
+}
+
+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);
+
+    ll A, B, C;
+    cin >> A >> C >> B;
+
+    ll const MOD = 1e9+7;
+    ll cn = (B * C % MOD - A * C % MOD + MOD) % MOD;
+    ll rn = (B * C % MOD - A * B % MOD + MOD) % MOD;
+    ll d  = (A * B % MOD - B * C % MOD + C * A % MOD + MOD) % MOD;
+    ll dd = modinv(d, MOD);
+    ll c = cn * dd % MOD;
+    ll r = rn * dd % MOD;
+
+    cout << r << " " << c << endl;
+
+    return 0;
+}