제출 #649628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
649628		KoalaMuch	Teleporters (IOI08_teleporters)	C++14	60 / 100	1084 ms	65536 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];
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=1;i<=2000000;i++) sz[i] = 1,p[i] = i;
    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;
        point.insert(tele[i].first);
        point.insert(tele[i].second);
    }
    for(int i=0;i<n;i++){
        auto nxt = point.upper_bound(tele[i].second);
        if(nxt!=point.end()&&fin(*nxt)!=fin(tele[i].first)){
            sz[fin(tele[i].first)]+=sz[fin(*nxt)];
            p[fin(*nxt)] = fin(tele[i].first);
        }
        nxt = point.upper_bound(tele[i].first);
        if(nxt!=point.end()&&fin(*nxt)!=fin(tele[i].second)){
            sz[fin(tele[i].second)]+=sz[fin(*nxt)];
            p[fin(*nxt)] = 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;
        pq.push(sz[fin(i)]);
        mark[fin(i)] = true;
    }
    while(!pq.empty()&&m){
        ans+=pq.top()+2;
        pq.pop();
        --m;
    }
    cout << ans+2*m << "\n";
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 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: 0 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5