CF and AtCoder solutions.

mitkonikov · mitkonikov · commit 7cadd59919cd · 2022-10-01T18:57:32.000+02:00
diff --git a/AtCoder/D_-_Destroyer_Takahashi.cpp b/AtCoder/D_-_Destroyer_Takahashi.cpp
@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int n, d;
+    cin >> n >> d;
+    vector<pair<int, int>> events(n);
+    for (int i = 0; i < n; i++) {
+        cin >> events[i].first >> events[i].second;
+    }
+
+    sort(events.begin(), events.end(), [&](const pair<int, int> &a, const pair<int, int> &b) {
+        return (a.second < b.second);
+    });
+
+    int x = INT_MIN;
+    int ans = 0;
+    for (int i = 0; i < n; i++) {
+        if (x + d - 1 < events[i].first) {
+            ans++;
+            x = events[i].second;
+        }
+    }
+
+    cout << ans << endl;
+    return 0;
+}
diff --git a/AtCoder/D_-_Neighbors.cpp b/AtCoder/D_-_Neighbors.cpp
@@ -0,0 +1,71 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int n, m;
+    cin >> n >> m;
+
+    vector<set<int>> adj(n);
+    for (int i = 0; i < m; i++) {
+        int u, v;
+        cin >> u >> v;
+        u--; v--;
+        adj[u].insert(v);
+        adj[v].insert(u);
+    }
+    
+    bool ok = true;
+    for (int i = 0; i < n; i++) {
+        if (adj[i].size() > 2) {
+            ok = false;
+            break;
+        }
+    }
+
+    vector<bool> visited(n, false);
+
+    for (int i = 0; i < n && ok; i++) {
+        if (visited[i]) continue;
+        visited[i] = true;
+        if (adj[i].empty()) continue;
+
+        int L = *adj[i].begin();
+        visited[L] = true;
+        adj[i].erase(L);
+        int prL = i;
+        while (true) {
+            adj[L].erase(prL);
+            prL = L;
+            if (adj[L].empty()) break;
+            L = *adj[L].begin();
+            if (visited[L]) {
+                ok = false;
+                break;
+            }
+            visited[L] = true;
+        }
+
+        if (adj[i].empty()) continue;
+        int R = *adj[i].begin();
+        adj[i].erase(R);
+        visited[R] = true;
+        int prR = i;
+        while (true) {
+            adj[R].erase(prR);
+            prR = R;
+            if (adj[R].empty()) break;
+            R = *adj[R].begin();
+            if (visited[R]) {
+                ok = false;
+                break;
+            }
+            visited[R] = true;
+        }
+    }
+
+    cout << (ok ? "Yes" : "No") << endl;
+    return 0;
+}
diff --git a/AtCoder/D_-_Range_Count_Query.cpp b/AtCoder/D_-_Range_Count_Query.cpp
@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int n;
+    cin >> n;
+
+    vector<vector<int>> adj(n + 10);
+    for (int i = 0; i < n; i++) {
+        int x;
+        cin >> x;
+        adj[x].push_back(i);
+    }
+
+    for (int i = 0; i <= n; i++) {
+        sort(adj[i].begin(), adj[i].end());
+    }
+
+    int q;
+    cin >> q;
+    for (int i = 0; i < q; i++) {
+        int l, r, x;
+        cin >> l >> r >> x;
+        l--; r--;
+        
+        int L = lower_bound(adj[x].begin(), adj[x].end(), l) - adj[x].begin();
+        int R = upper_bound(adj[x].begin(), adj[x].end(), r) - adj[x].begin();
+        cout << R - L << endl;
+    }
+
+    cout << flush;
+    return 0;
+}
diff --git a/AtCoder/D_-_Trophy.cpp b/AtCoder/D_-_Trophy.cpp
@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int n;
+    ll x;
+    cin >> n >> x;
+    vector<pair<int, int>> v(n);
+    for (int i = 0; i < n; i++) {
+        cin >> v[i].first >> v[i].second;
+    }
+    ll cost_to = 0;
+    ll mn = INT_MAX;
+    ll best = (ll)v[0].first + (x * (ll)v[0].second);
+    for (int i = 0; i < n; i++) {
+        best = min(best, cost_to + mn * (x - i));
+        cost_to = cost_to + v[i].first + v[i].second;
+        mn = min(mn, (ll)v[i].second);
+    }
+    best = min(best, cost_to + mn * (x - n));
+    cout << best << endl;
+    cout << flush;
+    return 0;
+}
diff --git a/BFS/AtCoder - D_-_Jumping_Takahashi_2.cpp b/BFS/AtCoder - D_-_Jumping_Takahashi_2.cpp
@@ -0,0 +1,91 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+struct point {
+    ll x, y, p;
+    
+    void read() {
+        cin >> x >> y >> p;
+    }
+
+    ll man(const point& other) {
+        return abs(x - other.x) + abs(y - other.y);
+    }
+};
+
+int main() {
+    int n;
+    cin >> n;
+    vector<point> v(n);
+    for (int i = 0; i < n; i++) {
+        v[i].read();
+    }
+
+    ll L = 0, R = 4e9 + 1000;
+    while (R - L > 1) {
+        ll mid = (L + R) / 2;
+        
+        bool ok = false;
+        for (int i = 0; i < n && !ok; i++) {
+            queue<int> q;
+            q.push(i);
+            vector<bool> visited(n, false);
+            visited[i] = true;
+            while (!q.empty()) {
+                int p = q.front();
+                q.pop();
+                for (int k = 0; k < n; k++) {
+                    if (k == p || visited[k]) continue;
+                    if (v[p].p * mid >= v[p].man(v[k])) {
+                        visited[k] = true;
+                        q.push(k);
+                    }
+                }
+            }
+
+            bool ac = true;
+            for (int i = 0; i < n; i++) if (!visited[i]) ac = false;
+            ok |= ac;
+        }
+        
+        if (ok) R = mid;
+        else L = mid+1;
+    }
+
+    for (int off = -5; off <= 5; off++) {
+        ll mid = L + off;
+        if (mid < 0) continue;
+        bool ok = false;
+        for (int i = 0; i < n && !ok; i++) {
+            queue<int> q;
+            q.push(i);
+            vector<bool> visited(n, false);
+            visited[i] = true;
+            while (!q.empty()) {
+                int p = q.front();
+                q.pop();
+                for (int k = 0; k < n; k++) {
+                    if (k == p || visited[k]) continue;
+                    if (v[p].p * mid >= v[p].man(v[k])) {
+                        visited[k] = true;
+                        q.push(k);
+                    }
+                }
+            }
+
+            bool ac = true;
+            for (int i = 0; i < n; i++) if (!visited[i]) ac = false;
+            ok |= ac;
+        }
+        if (ok) {
+            cout << mid << endl;
+            return 0;
+        }
+    }
+    
+    cout << flush;
+    return 0;
+}
diff --git a/CodeForces/C_Make_it_Increasing.cpp b/CodeForces/C_Make_it_Increasing.cpp
@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int n;
+    cin >> n;
+
+    ll ans = LLONG_MAX;
+    vector<ll> v(n);
+    for (int i = 0; i < n; i++) cin >> v[i];
+    
+    for (int i = 0; i < n; i++) {
+        ll cur = 0;
+        ll right = 0;
+        for (int j = i - 1; j >= 0; j--) {
+            ll times = (right / v[j]) + 1;
+            cur += times;
+            right = times * v[j];
+        }
+        
+        right = 0;
+        for (int j = i + 1; j < n; j++) {
+            ll times = (right / v[j]) + 1;
+            cur += times;
+            right = times * v[j];
+        }
+
+        ans = min(ans, cur);
+    }
+
+    cout << ans << endl;
+    return 0;
+}
diff --git a/CodeForces/C_Mark_and_His_Unfinished_Essay.cpp b/CodeForces/C_Mark_and_His_Unfinished_Essay.cpp
@@ -0,0 +1,65 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+struct sub {
+    ll L, R;
+    ll jump;
+};
+
+void testCase() {
+    int n, copy, q;
+    cin >> n >> copy >> q;
+    string s;
+    cin >> s;
+
+    vector<sub> v;
+    v.push_back({ 0, n-1, 0 });
+
+    for (int i = 0; i < copy; i++) {
+        ll L, R;
+        cin >> L >> R;
+        L--; R--;
+
+        v.push_back({
+            v.back().R + 1,
+            v.back().R + 1 + (R - L),
+            L
+        });
+    }
+
+    for (int i = 0; i < q; i++) {
+        ll K;
+        cin >> K;
+        K--;
+        for (const auto& SUB: v) {
+            if (K >= SUB.L && K <= SUB.R) {
+                K = SUB.jump + K - SUB.L;
+                while (K >= n) {
+                    for (int i = 0; i < v.size(); i++) {
+                        const auto& SUB = v[i];
+                        if (K >= SUB.L && K <= SUB.R) {
+                            K = SUB.jump + K - SUB.L;
+                        }
+                    }
+                }
+                cout << s[K] << endl;
+                break;
+            }
+        }
+    }
+}
+
+int main() {
+    int t;
+    cin >> t;
+
+    while (t--) {
+        testCase();
+    }
+
+    cout << flush;
+    return 0;
+}
diff --git a/Deque/D_-_Cylinder.cpp b/Deque/D_-_Cylinder.cpp
diff --git a/Math/AtCoder - D_-_Polynomial_division.cpp b/Math/AtCoder - D_-_Polynomial_division.cpp
diff --git a/map/AtCoder - D_-_Draw_Your_Cards.cpp b/map/AtCoder - D_-_Draw_Your_Cards.cpp
