제출 #262178

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
262178		WLZ	Teleporters (IOI08_teleporters)	C++14	100 / 100	862 ms	46956 KiB

teleporters

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

const int MAXN = (int) 2e6;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<int> other(MAXN + 1, -1);
  vector<int> a;
  for (int i = 0; i < n; i++) {
    int w, e;
    cin >> w >> e;
    other[w] = e; other[e] = w;
    a.push_back(w); a.push_back(e);
  }
  sort(a.begin(), a.end());
  vector<int> next(2 * n + 1, -1);
  for (int i = 0; i < 2 * n; i++) {
    next[i] = upper_bound(a.begin(), a.end(), other[a[i]]) - a.begin();
  }
  vector<bool> was(2 * n + 1, false); was[0] = true;
  queue<int> q; q.push(0);
  int ans = 0;
  while (!q.empty()) {
    int u = q.front(); q.pop();
    if (next[u] != -1 && !was[next[u]]) {
      ans++;
      q.push(next[u]);
      was[next[u]] = true;
    }
  }
  vector<int> b;
  for (int i = 0; i < 2 * n; i++) {
    if (was[i]) {
      continue;
    }
    q.push(i);
    was[i] = true;
    b.push_back(0);
    while (!q.empty()) {
      int u = q.front(); q.pop();
      b.back()++;
      if (next[u] != -1 && !was[next[u]]) {
        q.push(next[u]);
        was[next[u]] = true;
      }
    }
  }
  sort(b.rbegin(), b.rend());
  for (int i = 0; i < min((int) b.size(), m); i++) {
    ans += b[i] + 2;
  }
  m -= min((int) b.size(), m);
  ans += (m + 1) / 2 + (m / 2) * 3;
  cout << ans << '\n';
  return 0;
}

• 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