Merge pull request #514 from xirc/atcoder/abc192

AtCoder/ABC192

Author: xirc

atcoder/abc192/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 X;
+    cin >> X;
+    X %= 100;
+    cout << (100 - X) << endl;
+
+    return 0;
+}

atcoder/abc192/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);
+
+    string S;
+    cin >> S;
+    int const N = S.size();
+    bool difficult = true;
+    for (int i = 0; i < N; i += 2) {
+        if (!islower(S[i])) difficult = false;
+    }
+    for (int i = 1; i < N; i += 2) {
+        if (!isupper(S[i])) difficult = false;
+    }
+    cout << (difficult ? "Yes" : "No") << endl;
+
+    return 0;
+}

atcoder/abc192/C/main.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+vector<int> digits(ll x) {
+    vector<int> xs;
+    while (x > 0) {
+        xs.push_back(x % 10);
+        x /= 10;
+    }
+    return xs;
+}
+
+ll g1(vector<int>& digits) {
+    sort(digits.begin(), digits.end(), greater<int>());
+    ll y = 0;
+    for (auto d : digits) {
+        y = y * 10 + d;
+    }
+    return y;
+}
+ll g2(vector<int>& digits) {
+    sort(digits.begin(), digits.end(), less<int>());
+    ll y = 0;
+    for (auto d : digits) {
+        y = y * 10 + d;
+    }
+    return y;
+}
+ll f(ll x) {
+    vector<int> xs = digits(x);
+    return g1(xs) - g2(xs);
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int N, K;
+    cin >> N >> K;
+
+    ll a = N;
+    for (int i = 0; i < K; ++i) {
+        a = f(a);
+    }
+    cout << a << endl;
+
+    return 0;
+}

atcoder/abc192/D/main.cpp

@@ -0,0 +1,62 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+string X;
+ll M;
+
+bool pass(ll n) {
+    if (n == 0) return true;
+    ll v = 0;
+    for (int i = 0; i < X.size(); ++i) {
+        int x = X[i] - '0';
+        if (v > M / n) return false;
+        v *= n;
+        if (v > M - x) return false;
+        v += x;
+    }
+    return true;
+}
+
+int minbase() {
+    int n = 0;
+    for (int i = 0; i < X.size(); ++i) {
+        n = max(n, X[i] - '0');
+    }
+    return n + 1;
+}
+
+ll maxbase() {
+    ll ok = 0, ng = 2e18;
+    while (abs(ok - ng) > 1) {
+        auto m = (ok + ng) / 2;
+        if (pass(m)) {
+            ok = m;
+        } else {
+            ng = m;
+        }
+    }
+    return ok;
+}
+
+ll solve() {
+    if (X.size() == 1) {
+        return (X[0]-'0' <= M) ? 1 : 0;
+    }
+    ll mini = minbase();
+    ll maxi = maxbase();
+    if (maxi < mini) return 0;
+    return maxi - mini + 1;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> X >> M;
+    cout << solve() << endl;
+
+    return 0;
+}

atcoder/abc192/E/main.cpp

@@ -0,0 +1,56 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N, M, X, Y;
+vector<vector<array<int,3>>> G;
+
+ll solve() {
+    using entry = pair<ll,int>;
+    priority_queue<entry, vector<entry>, greater<entry>> Q;
+    ll const inf = 1e18;
+    vector<ll> D(N, inf);
+    Q.push({ 0, X });
+    D[X] = 0;
+    while (Q.size()) {
+        ll t; int v;
+        tie(t, v) = Q.top(); Q.pop();
+        if (v == Y) {
+            return t;
+        }
+        for (auto utk : G[v]) {
+            int u = utk[0], T = utk[1], K = utk[2];
+            ll tn = t;
+            if (tn % K != 0) {
+                tn += (K - tn % K);
+            }
+            if (tn + T < D[u]) {
+                D[u] = tn + T;
+                Q.push({ D[u], u });
+            }
+        }
+    }
+    return -1;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N >> M >> X >> Y;
+    --X, --Y;
+
+    G.assign(N, vector<array<int,3>>());
+    for (int i = 0; i < M; ++i) {
+        int A, B, T, K;
+        cin >> A >> B >> T >> K;
+        --A, --B;
+        G[A].push_back({ B, T, K });
+        G[B].push_back({ A, T, K });
+    }
+    cout << solve() << endl;
+
+    return 0;
+}