Submission #649630

# Submission time Handle Problem Language Result Execution time Memory
649630 2022-10-11T07:20:42 Z KoalaMuch Teleporters (IOI08_teleporters) C++14
65 / 100
1000 ms 65536 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];
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;
}
# Verdict Execution time Memory Grader output
1 Correct 9 ms 15956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 15984 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 15932 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 15956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 15952 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 15956 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 11 ms 15972 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 15956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 15956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 15956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 16008 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 16340 KB Output is correct
2 Correct 23 ms 17304 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 16468 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 26 ms 17420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 35 ms 17892 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 309 ms 31528 KB Output is correct
2 Correct 877 ms 55028 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 568 ms 43900 KB Output is correct
2 Execution timed out 1051 ms 65536 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 797 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 922 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 812 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -