Merge pull request #511 from xirc/atcoder/abc188

AtCoder/ABC188

Author: xirc

atcoder/abc188/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, Y;
+    cin >> X >> Y;
+    bool ans = abs(X - Y) < 3;
+    cout << (ans ? "Yes" : "No") << endl;
+
+    return 0;
+}

atcoder/abc188/B/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 N;
+    cin >> N;
+    vector<int> A(N), B(N);
+    for (auto &a : A) cin >> a;
+    for (auto &b : B) cin >> b;
+
+    ll ip = 0;
+    for (int i = 0; i < N; ++i) {
+        ip += A[i] * B[i];
+    }
+    bool ans = ip == 0;
+    cout << (ans ? "Yes" : "No") << endl;
+
+    return 0;
+}

atcoder/abc188/C/main.cpp

@@ -0,0 +1,28 @@
+#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;
+    vector<int> A;
+
+    cin >> N;
+    M = 1 << N;
+    A.assign(M, 0);
+    for (int i = 0; i < M; ++i) {
+        cin >> A[i];
+    }
+
+    M /= 2;
+    auto l = distance(A.begin(), max_element(A.begin(), A.begin() + M));
+    auto r = distance(A.begin(), max_element(A.begin() + M, A.end()));
+    int ans = (A[l] < A[r]) ? l : r;
+    cout << (ans+1) << endl;
+
+    return 0;
+}

atcoder/abc188/D/main.cpp

@@ -0,0 +1,45 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N, C;
+vector<int> as, bs, cs;
+
+ll solve() {
+    vector<pair<int,int>> events;
+    for (int i = 0; i < N; ++i) {
+        events.push_back(make_pair(as[i], cs[i]));
+        events.push_back(make_pair(bs[i]+1, -cs[i]));
+    }
+    sort(events.begin(), events.end());
+
+    int time = 0;
+    ll charge_per_day = 0;
+    ll total_charge = 0;
+    for (auto const& event : events) {
+        int t, charge;
+        tie(t, charge) = event;
+        total_charge += (t - time) * min(ll(C), charge_per_day);
+        charge_per_day += charge;
+        time = t;
+    }
+    return total_charge;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N >> C;
+    as.assign(N, 0);
+    bs.assign(N, 0);
+    cs.assign(N, 0);
+    for (int i = 0; i < N; ++i) {
+        cin >> as[i] >> bs[i] >> cs[i];
+    }
+    cout << solve() << endl;
+
+    return 0;
+}

atcoder/abc188/E/main.cpp

@@ -0,0 +1,55 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N, M;
+vector<int> A;
+vector<vector<int>> G;
+
+int ans;
+vector<bool> done;
+vector<int> maxi;
+void dfs(int v) {
+    if (done[v]) return;
+    done[v] = true;
+    maxi[v] = A[v];
+    for (int u : G[v]) {
+        dfs(u);
+        ans = max(ans, maxi[u] - A[v]);
+        maxi[v] = max(maxi[u], maxi[v]);
+    }
+}
+
+int solve() {
+    ans = numeric_limits<int>::lowest();
+    done.assign(N, 0);
+    maxi.assign(N, numeric_limits<int>::lowest());
+    for (int v = 0; v < N; ++v) {
+        if (done[v]) continue;
+        dfs(v);
+    }
+    return ans;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N >> M;
+    A.assign(N, 0);
+    for (int i = 0; i < N; ++i) {
+        cin >> A[i];
+    }
+    G.assign(N, {});
+    for (int i = 0; i < M; ++i) {
+        int a, b;
+        cin >> a >> b;
+        --a, --b;
+        G[a].push_back(b);
+    }
+    cout << solve() << endl;
+
+    return 0;
+}