제출 #262153

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

teleporters

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

vector< vector<int> > g;
vector<bool> was;
int sz = 0;

void dfs(int u) {
  was[u] = true;
  for (auto& v : g[u]) {
    sz++;
    if (!was[v]) {
      dfs(v);
    }
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  map<int, int> other;
  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(e);
    a.push_back(w);
  }
  sort(a.begin(), a.end());
  g.resize(2 * n + 1);
  for (int i = 0; i < 2 * n; i++) {
    g[i].push_back(upper_bound(a.begin(), a.end(), other[a[i]]) - a.begin());
  }  
  was.assign(2 * n + 1, false);
  dfs(0);
  int ans = sz;
  priority_queue<int> pq;
  for (int i = 0; i <= 2 * n; i++) {
    if (!was[i]) {
      sz = 0;
      dfs(i);
      pq.push(sz);
    }
  }
  while (m > 0 && !pq.empty()) {
    ans += pq.top() + 2;
    pq.pop();
    m--;
  }
  while (m > 0) {
    ans++;
    m--;
    if (m > 0) {
      ans += 3;
      m--;
    }
  }
  cout << ans + m << '\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: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5