Submission #906637

#	Time	Username	Problem	Language	Result	Execution time	Memory
906637		JakobZorz	Teleporters (IOI08_teleporters)	C++17	10 / 100	196 ms	28488 KiB

teleporters

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;

void solve(){
    int n,m;
    cin>>n>>m;
    vector<int>nxt(2e6,-1);
    vector<bool>vis(2e6);
    for(int i=0;i<n;i++){
        int a,b;
        cin>>a>>b;
        a--;b--;
        nxt[a]=b;
        nxt[b]=a;
    }
    
    priority_queue<int>q;
    int ms=-1;
    for(int i=0;i<2e6;i++){
        if(vis[i])
            continue;
        int curr=i;
        int size=0;
        while(curr<2e6&&!vis[curr]){
            vis[curr]=true;
            if(nxt[curr]==-1)
                curr++;
            else{
                curr=nxt[curr];
                size++;
            }
        }
        if(ms==-1)
            ms=size;
        else
            q.push(size);
    }
    
    while(m&&q.size()){
        ms+=q.top()+2;
        m--;
        q.pop();
    }
    cout<<ms+m+m/2*2<<"\n";
}
 
int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("input.in","r",stdin);freopen("output.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}

/*
 
3
1
10 11
1 4
2 3

6
 
 */

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 5 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5