제출 #599103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599103		piOOE	Rope (JOI17_rope)	C++17	100 / 100	1291 ms	234964 KiB

rope

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 1000000, M = 10000000;

int a[N], ans[M], cnt[M];

vector<int> g[N];
priority_queue<pair<int, int>> pq;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  memset(ans, 0x3f, sizeof(ans));
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    --a[i];
    ++cnt[a[i]];
  }
  for (int i = 0; i < m; ++i) {
    pq.push({cnt[i], i});
  }
  for (int k = 0; k < 2; ++k) {
    for (int i = 0; i < m; ++i) {
      g[i].clear();
    }
    for (int i = k; i + 1 < n; i += 2) {
      if (a[i] != a[i + 1]) {
        g[a[i]].push_back(a[i + 1]);
        g[a[i + 1]].push_back(a[i]);
      }
    }
    for (int c = 0; c < m; ++c) {
      int now = cnt[c];
      auto upd = [](int v, int nw) {
        pq.push({cnt[v] = nw, v});
      };
      upd(c, 0);
      for (int to : g[c]) {
        upd(to, cnt[to] - 1);
      }
      while (cnt[pq.top().second] != pq.top().first) {
        pq.pop();
      }
      ans[c] = min(ans[c], n - now - pq.top().first);
      upd(c, now);
      for (int to : g[c]) {
        upd(to, cnt[to] + 1);
      }
    }
  }
  for (int i = 0; i < m; ++i) {
    cout << ans[i] << "\n";
  }
  return 0;
}

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