Submission #864777

#	Time	Username	Problem	Language	Result	Execution time	Memory
864777		green_gold_dog	Rope (JOI17_rope)	C++17	100 / 100	2213 ms	143888 KiB

rope

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef int ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, m;
        cin >> n >> m;
        if (m == 1) {
                cout << 0 << '\n';
                return;
        }
        vector<ll> arr(n);
        for (ll i = 0; i < n; i++) {
                cin >> arr[i];
                arr[i]--;
        }
        vector<ll> c(m);
        for (auto i : arr) {
                c[i]++;
        }
        vector<pair<ll, ll>> vc;
        for (ll i = 0; i < m; i++) {
                vc.emplace_back(c[i], i);
        }
        sort(vc.begin(), vc.end());
        vector<ll> ans(m, n);
        {
                unordered_map<pair<ll, ll>, ll> ma;
                for (ll i = 0; i + 1 < n; i += 2) {
                        ma[make_pair(arr[i], arr[i + 1])]++;
                        ma[make_pair(arr[i + 1], arr[i])]++;
                }
                for (ll i = 0; i < m; i++) {
                        for (ll j = m - 1; j >= 0; j--) {
                                if (vc[j].second != i) {
                                        assign_min(ans[i], n - c[i] - vc[j].first + ma[make_pair(i, vc[j].second)]);
                                        if (ma[make_pair(i, vc[j].second)] == 0) {
                                                break;
                                        }
                                }
                        }
                }
        }
        {
                unordered_map<pair<ll, ll>, ll> ma;
                for (ll i = 1; i + 1 < n; i += 2) {
                        ma[make_pair(arr[i], arr[i + 1])]++;
                        ma[make_pair(arr[i + 1], arr[i])]++;
                }
                for (ll i = 0; i < m; i++) {
                        for (ll j = m - 1; j >= 0; j--) {
                                if (vc[j].second != i) {
                                        assign_min(ans[i], n - c[i] - vc[j].first + ma[make_pair(i, vc[j].second)]);
                                        if (ma[make_pair(i, vc[j].second)] == 0) {
                                                break;
                                        }
                                }
                        }
                }
        }
        for (auto i : ans) {
                cout << i << '\n';
        }
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message (stderr)

rope.cpp:12:22: warning: overflow in conversion from 'long int' to 'll' {aka 'int'} changes value from '9000000000000000000' to '-494665728' [-Woverflow]
   12 | constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~
rope.cpp: In function 'int main()':
rope.cpp:113:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
rope.cpp:114:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 30 / 30
• Subtask 3: 10 / 10
• Subtask 4: 25 / 25
• Subtask 5: 20 / 20