Submission #397587

#	Time	Username	Problem	Language	Result	Execution time	Memory
397587		timmyfeng	Rope (JOI17_rope)	C++17	100 / 100	1301 ms	198184 KiB

rope

#include <bits/stdc++.h>
using namespace std;

const int N = 1000001;

int color[N], tally[N], ans[N];
vector<int> pairs[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; ++i) {
        cin >> color[i];
        ++tally[color[i]];
    }

    priority_queue<array<int, 2>> maxi;
    for (int i = 1; i <= m; ++i) {
        maxi.push({tally[i], i});
        ans[i] = INT_MAX;
    }

    for (int k = 0; k < 2; ++k) {
        fill(pairs, pairs + m + 1, vector<int>());
        for (int i = k; i + 2 <= n; i += 2) {
            if (color[i] != color[i + 1]) {
                pairs[color[i]].push_back(color[i + 1]);
                pairs[color[i + 1]].push_back(color[i]);
            }
        }
 
        for (int i = 1; i <= m; ++i) {
            int temp = tally[i];
            maxi.push({0, i});
            tally[i] = 0;

            for (auto j : pairs[i]) {
                maxi.push({--tally[j], j});
            }

            while (maxi.top()[0] != tally[maxi.top()[1]]) {
                maxi.pop();
            }
 
            ans[i] = min(ans[i], n - temp - maxi.top()[0]);
 
            for (auto j : pairs[i]) {
                maxi.push({++tally[j], j});
            }

            tally[i] = temp;
            maxi.push({tally[i], i});
        }
    }

    for (int i = 1; i <= m; ++i) {
        cout << ans[i] << "\n";
    }
}

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