제출 #649640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
649640		KoalaMuch	Teleporters (IOI08_teleporters)	C++14	100 / 100	527 ms	41548 KiB

teleporters

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
set<int> point;
int p[2*N];
int sz[2*N];
int mark[2*N];
pair<int,int> tele[N];
bool exist[2*N];
int nxt[2*N];
int cntSz[2*N];
priority_queue<int> pq;
int fin(int i){
    if(p[i]==i) return i;
    return p[i] = fin(p[i]);
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m,mn=1e9;
    cin >> n >> m;
    for(int i=0;i<n;i++){
        cin >> tele[i].first >> tele[i].second;
        mn = min(mn,tele[i].first);
        exist[tele[i].first] = exist[tele[i].second] = true;
        sz[tele[i].first] = sz[tele[i].second] = 1;
        p[tele[i].first] = tele[i].first;
        p[tele[i].second] = tele[i].second;
    }
    int prev = mn;
    for(int i=mn+1;i<=2000000;i++){
        if(exist[i])    nxt[prev] = i,prev=i;
    }
    for(int i=0;i<n;i++){
        int next = nxt[tele[i].second];
        if(next!=0&&fin(next)!=fin(tele[i].first)){
            sz[fin(tele[i].first)]+=sz[fin(next)];
            p[fin(next)] = fin(tele[i].first);
        }
        next = nxt[tele[i].first];
        if(next!=0&&fin(next)!=fin(tele[i].second)){
            sz[fin(tele[i].second)]+=sz[fin(next)];
            p[fin(next)] = fin(tele[i].second);
        }
    }
    int ans = sz[fin(mn)];
    mark[fin(mn)] = true;
    for(int i=1;i<=2000000;i++){
        if(!exist[i]||mark[fin(i)])   continue;
        cntSz[sz[fin(i)]]++;
        mark[fin(i)] = true;
    }
    for(int i=2000000;i>=1;i--){
        while(m&&cntSz[i])  ans+=i+2,--m,--cntSz[i];
    }
    cout << ans+2*m-(m%2) << "\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