제출 #556746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
556746		timreizin	Teleporters (IOI08_teleporters)	C++17	95 / 100	1008 ms	46320 KiB

teleporters

#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <string>
#include <numeric>
#include <cmath>
#include <cassert>
#include <array>
#include <numeric>

using namespace std;

using ll = long long;

const ll INF = 1e18;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> we(n);
    vector<pair<int, int>> closest;
    for (int i = 0; i < n; ++i)
    {
        cin >> we[i].first >> we[i].second;
        closest.push_back({we[i].first, i * 2});
        closest.push_back({we[i].second, i * 2 + 1});
    }
    sort(closest.begin(), closest.end());
    vector<int> adj(2 * n, -1);
    for (int i = 0; i < n; ++i)
    {
        auto it = upper_bound(closest.begin(), closest.end(), pair(we[i].second, (int)1e9));
        if (it != closest.end()) adj[2 * i] = it->second;
        it = upper_bound(closest.begin(), closest.end(), pair(we[i].first, (int)1e9));
        if (it != closest.end()) adj[2 * i + 1] = it->second;
    }
    int start = closest.front().second;
    vector<bool> used(2 * n);
    auto dfs = [&adj, &used](auto self, int v) -> int
    {
        used[v] = true;
        if (adj[v] == -1 || used[adj[v]]) return 1;
        return self(self, adj[v]) + 1;
    };
    int res = dfs(dfs, start);
    vector<int> comps;
    for (int i = 0; i < 2 * n; ++i) if (!used[i]) comps.push_back(dfs(dfs, i));
    sort(comps.rbegin(), comps.rend());
    for (int i = 0; i < min(m, (int)comps.size()); ++i) res += comps[i] + 2;
    m -= (int)comps.size();
    m = max(m, 0);
    res += 2 * (m - m % 2);
    res += m % 2;
    cout << res;
    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: 0 / 5