제출 #734081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
734081		lorenzoferrari	Teleporters (IOI08_teleporters)	C++17	100 / 100	717 ms	38772 KiB

teleporters

#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

static constexpr int N = 2e6 + 42;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    int m; cin >> m;
    vector<array<int, 2>> adj;
    for (int i = 0, a, b; i < n; ++i) {
        cin >> a >> b;
        adj.push_back({a, b});
        adj.push_back({b, a});
    }
    sort(begin(adj), end(adj));
    int last = adj.back()[0];
    auto find_next = [&](int i) -> int {
        auto it = upper_bound(begin(adj), end(adj), array<int,2>{i, N});
        return (*it)[1];
    };
    int ans = 0;
    bitset<N> vis;
    for (int cur = 0; cur != last;) {
        vis[cur] = true;
        cur = find_next(cur);
        ++ans;
    }
    vector<int> cyc;
    for (auto [a, b] : adj) {
        if (vis[a] || a == last) continue;
        int len = 0;
        while (!vis[a]) {
            vis[a] = true;
            a = find_next(a);
            ++len;
        }
        cyc.push_back(len);
    }
    sort(begin(cyc), end(cyc));
    while (m--) {
        if (!cyc.empty()) {
            ans += 2 + cyc.back();
            cyc.pop_back();
        } else {
            ans += 1;
            cyc.push_back(1);
        }
    }
    cout << ans << "\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