제출 #775390

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775390		PoonYaPat	Teleporters (IOI08_teleporters)	C++14	100 / 100	385 ms	56436 KiB

teleporters

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;

int n,m,ed=2000005;
ll ans;
pii nxt[2000010];
bool vis[2000010];
priority_queue<ll> q;

ll dfs(int x) {
    if (vis[x]) return 0;
    vis[x]=true;
    return nxt[x].second+dfs(nxt[x].first);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;
    for (int i=0; i<ed; ++i) nxt[i]=pii(i+1,0);
    for (int i=0; i<n; ++i) {
        int a,b; cin>>a>>b;
        nxt[a]=pii(b+1,1);
        nxt[b]=pii(a+1,1);
    }

    ans=dfs(0);
    for (int i=0; i<ed; ++i) if (!vis[i]) q.push(dfs(i));
    while (m--) {
        if (q.size()) ans+=(q.top()+2), q.pop();
        else q.push(1), ++ans;
    }
    cout<<ans;
}

• 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