oj.uz

Submission #649636

# Submission time Handle Problem Language Result Execution time Memory
649636 2022-10-11T07:28:23 Z KoalaMuch Teleporters (IOI08_teleporters) C++14
100 / 100
 971 ms 52492 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 2e6+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];
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;
    }
    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;
        pq.push(sz[fin(i)]);
        mark[fin(i)] = true;
    }
    while(!pq.empty()&&m){
        ans+=pq.top()+2;
        pq.pop();
        --m;
    }
    cout << ans+2*m-(m%2) << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15956 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15956 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15936 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 15956 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16108 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15956 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15896 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15980 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15956 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 15956 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 15952 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16136 KB Output is correct
2 Correct 20 ms 16596 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16212 KB Output is correct
2 Correct 24 ms 17108 KB Output is correct
3 Correct 40 ms 16448 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16340 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 16460 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 21592 KB Output is correct
2 Correct 316 ms 33396 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 28984 KB Output is correct
2 Correct 494 ms 37900 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 642 ms 44700 KB Output is correct
2 Correct 692 ms 52492 KB Output is correct
3 Correct 710 ms 51856 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 45928 KB Output is correct
2 Correct 929 ms 48832 KB Output is correct
3 Correct 866 ms 38848 KB Output is correct
4 Correct 913 ms 38908 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 923 ms 48188 KB Output is correct
2 Correct 971 ms 49480 KB Output is correct
3 Correct 718 ms 46900 KB Output is correct
4 Correct 826 ms 50692 KB Output is correct