제출 #583271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583271		Jomnoi	Teleporters (IOI08_teleporters)	C++17	100 / 100	359 ms	44532 KiB

teleporters

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

const int MAX_N = 1e6 + 5;
const int L = 2e6 + 1;

int W[MAX_N], E[MAX_N];
pair <int, int> nxt[L + 1];
bool visited[L + 1];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

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

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

        nxt[W[i]] = make_pair(E[i] + 1, 1);
        nxt[E[i]] = make_pair(W[i] + 1, 1);
    }

    priority_queue <int> pq;
    visited[L] = true;
    int ans = 0;
    for(int i = 0; i <= L; i++) {
        if(visited[i] == true) {
            continue;
        }

        int u = i, cnt = 0;
        while(visited[u] == false) {
            visited[u] = true;
            cnt += nxt[u].second;
            u = nxt[u].first;
        }

        if(i == 0) {
            ans = cnt;
        }
        else {
            pq.push(cnt);
        }
    }

    while(M--) {
        if(!pq.empty()) {
            ans += pq.top() + 2;
            pq.pop();
        }
        else {
            pq.push(1);
            ans++;
        }
    }
    cout << ans;
    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