Luogu/P3622/P3622.cpp

@@ -1,59 +0,0 @@
-#include <iostream>
-#include <algorithm>
-#include <limits>
-
-using namespace std;
-
-const int N = 1e4 + 5,
-          C = 5e4 + 5,
-          M = (1 << 5) + 5;
-
-int n, c, a[C][M], f[N][M], ans;
-
-int main() {
-    std::ios::sync_with_stdio(false);
-    cin.tie(nullptr);
-
-    cin >> n >> c;
-
-    for (int i = 1, e, f, l; i <= c; i++) {
-        cin >> e >> f >> l;
-
-        int fear = 0;
-
-        for (int j = 1, x; j <= f; j++) {
-            cin >> x;
-
-            fear |= (1 << (x - e + n) % n);
-        }
-
-        int like = 0;
-
-        for (int j = 1, y; j <= l; j++) {
-            cin >> y;
-
-            like |= (1 << (y - e + n) % n);
-        }
-
-        for (int j = 0; j < 1 << 5; j++) {
-            if ((like & j) || (fear & ~j)) a[e][j]++;
-        }
-    }
-
-    for (int s = 0; s < 1 << 5; s++) {
-        std::fill_n(f[0], M, std::numeric_limits<int>::min());
-        f[0][s] = 0;
-
-        for (int i = 1; i <= n; i++) {
-            for (int j = 0; j < 1 << 5; j++) {
-                f[i][j] = max(f[i - 1][(j & 0b1111) << 1], f[i - 1][(j & 0b1111) << 1 | 1]) + a[i][j];
-            }
-        }
-
-        ans = std::max(ans, f[n][s]);
-    }
-
-    cout << ans << endl;
-
-    return 0;
-}

Luogu/P4766/P4766.cpp

@@ -1,83 +0,0 @@
-#include <iostream>
-#include <algorithm>
-#include <array>
-#include <limits>
-#include <tuple>
-#include <vector>
-
-using std::cin;
-using std::cout;
-const char endl = '\n';
-
-const int N = 305;
-
-int main() {
-    std::ios::sync_with_stdio(false);
-    cin.tie(nullptr);
-
-    int t;
-
-    cin >> t;
-
-    while (t--) {
-        int n;
-
-        cin >> n;
-
-        std::vector<std::tuple<int, int, int>> data(n);
-        std::vector<int> nums;
-
-        for (auto& e : data) {
-            int a, b, d;
-
-            cin >> a >> b >> d;
-
-            e = std::make_tuple(a, b, d);
-            nums.emplace_back(a);
-            nums.emplace_back(b);
-        }
-
-        std::sort(nums.begin(), nums.end());
-        nums.erase(std::unique(nums.begin(), nums.end()), nums.end());
-
-        for (auto& e : data) {
-            std::get<0>(e) = std::lower_bound(nums.begin(), nums.end(), std::get<0>(e)) - nums.begin() + 1;
-            std::get<1>(e) = std::lower_bound(nums.begin(), nums.end(), std::get<1>(e)) - nums.begin() + 1;
-        }
-
-        int m = nums.size();
-        std::array<std::array<int, N << 1>, N << 1> f;
-
-        for (int len = 0; len < m; len++) {
-            for (int l = 1, r = 1 + len; r <= m; l++, r++) {
-                auto it = data.end();
-
-                for (auto _it = data.begin(); _it != data.end(); _it++) {
-                    int a, b, d;
-                    std::tie(a, b, d) = *_it;
-
-                    if (l <= a && b <= r && (it == data.end() || d > std::get<2>(*it))) {
-                        it = _it;
-                    }
-                }
-
-                if (it == data.end()) {
-                    f[l][r] = 0;
-                } else {
-                    f[l][r] = std::numeric_limits<int>::max();
-
-                    int a, b, d;
-                    std::tie(a, b, d) = *it;
-
-                    for (int i = a; i <= b; i++) {
-                        f[l][r] = std::min(f[l][r], f[l][i - 1] + d + f[i + 1][r]);
-                    }
-                }
-            }
-        }
-
-        cout << f[1][m] << endl;
-    }
-
-    return 0;
-}

S2OJ/1550/1550.cpp

@@ -1,38 +0,0 @@
-#include <iostream>
-#include <algorithm>
-
-using std::cin;
-using std::cout;
-const char endl = '\n';
-
-const int N = 1e5 + 5;
-
-int n, a[N], c[N], p, ans;
-
-int main() {
-    std::ios::sync_with_stdio(false);
-    cin.tie(nullptr);
-
-    cin >> n;
-
-    bool flag = n >= 3;
-
-    for (int i = 1; i <= n; i++) {
-        cin >> a[i];
-
-        if (a[i] == n) p = i;
-    }
-
-    flag &= a[1] == n - 1 && a[n] == n;
-
-    for (int i = 1; i < p; i++) {
-        if (a[i] > a[i + 1]) {
-            ans++;
-            std::swap(a[i], a[i + 1]);
-        }
-    }
-
-    cout << static_cast<long long>(n) * (n - 1) + ans - flag << endl;
-
-    return 0;
-}