제출 #1029650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029650		thinknoexit	Teleporters (IOI08_teleporters)	C++17	100 / 100	202 ms	36812 KiB

teleporters

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1001000;
bool ch[2 * N];
int w[2 * N], c[2 * N];
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    for (int i = 0;i <= 2000000;i++) w[i] = i + 1;
    for (int i = 1, l, r;i <= n;i++) {
        cin >> l >> r;
        w[l] = r + 1, c[l] = 1;
        w[r] = l + 1, c[r] = 1;
    }
    int ans = 0;
    vector<int> v;
    w[2000000] = 0;
    for (int i = 0;i <= 2000000;i++) {
        if (!ch[i]) {
            int now = i;
            int res = 0;
            while (!ch[now]) {
                ch[now] = 1;
                res += c[now];
                now = w[now];
            }
            if (i != 0) v.push_back(res);
            else ans += res;
        }
    }
    sort(v.rbegin(), v.rend());
    for (int i = 0;i < min(m, (int)v.size());i++) ans += v[i] + 2;
    m -= min(m, (int)v.size());
    if (m & 1) ans += 2 * m - 1;
    else ans += 2 * m;
    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