제출 #501684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
501684		600Mihnea	Teleporters (IOI08_teleporters)	C++17	100 / 100	447 ms	44504 KiB

teleporters

#include <bits/stdc++.h>

using namespace std;


signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

 /// freopen ("input", "r", stdin);

  int N, E;
  cin >> N >> E;
  vector<pair<int, int>> guys;
  for (int i = 0; i < N; i++) {
    int A, B;
    cin >> A >> B;
    guys.push_back({A, i});
    guys.push_back({B, i});
  }
  sort(guys.begin(), guys.end());
  vector<int> SM(N);
  for (int i = 0; i < 2 * N; i++) {
    SM[guys[i].second] += i;
  }
  vector<int> nxt(2 * N + 1);
  for (int i = 0; i < 2 * N; i++) {
    int Type = guys[i].second;
    int Other = SM[Type] - i;
    assert(0 <= Other && Other < 2 * N);
    nxt[i] = Other + 1;

  }

  bool WannaCheck = true;
  WannaCheck = false;
  if (WannaCheck) {
    map<int, int> B;
    for (int i = 0; i < 2 * N; i++) {
      B[nxt[i]]++;
    }
    for (int i = 1; i < 2 * N + 1; i++) {
      assert(B.count(i) && B[i] == 1);
    }
  }
  vector<bool> vis(2 * N + 1, false);

  int ZDApath = 0;
  for (int i = 0; i != 2 * N; i = nxt[i]) {
    ZDApath++;
    assert(!vis[i]);
    vis[i] = true;
  }

  vis[2 * N] = true;
  vector<int> SAD;
  for (int i = 0; i <= 2 * N; i++) {
    if (!vis[i]) {

      int LEN = 1;
      vis[i] = true;
      for (int j = nxt[i]; j != i; j = nxt[j]) {
        LEN++;
        assert(!vis[j]);
        vis[j] = true;
      }
      SAD.push_back(LEN);
    }
  }
  sort(SAD.begin(), SAD.end());
  int S = ZDApath;
  ///cout << N << " " << E << "\n";
  while (!SAD.empty() && E) {
    E--;
    S += 2 + SAD.back();
    SAD.pop_back();

  }
  for (int j = 1; j <= E; j++) {
    if (j & 1) {
      S += 1;
    } else {
      S += 3;
    }
  }
  cout << S << "\n";
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5