Submission #1325698

#	Time	Username	Problem	Language	Result	Execution time	Memory
1325698		kasamchi	Teleporters (IOI08_teleporters)	C++20	80 / 100	1100 ms	105928 KiB

teleporters

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

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

    int N, M;
    cin >> N >> M;

    vector<int> W(N), E(N);
    for (int i = 0; i < N; i++) {
        cin >> W[i] >> E[i];
    }

    map<int, int> mp;
    for (int i = 0; i < N; i++) {
        mp[W[i]] = E[i];
        mp[E[i]] = W[i];
    }

    vector<int> szs;
    while (!mp.empty()) {
        int pos = 0, cnt = 0;
        set<int> vis;
        while (true) {
            auto it = mp.upper_bound(pos);
            if (it == mp.end() || vis.count(it -> first)) {
                break;
            }
            vis.insert(it -> first);
            pos = it -> second;
            cnt++;
        }
        for (int x : vis) {
            mp.erase(x);
        }
        szs.push_back(cnt);
    }
    sort(szs.begin() + 1, szs.end(), greater<>());

    if (M >= szs.size() - 1) {
        cout << (N + M) * 2 - (M - szs.size() + 1) % 2 << '\n';
    } else {
        int ans = szs[0];
        for (int i = 1; i <= M; i++) {
            ans += szs[i];
        }
        cout << ans + M * 2 << '\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: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5