제출 #894211

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894211		abcvuitunggio	Teleporters (IOI08_teleporters)	C++17	0 / 100	270 ms	44560 KiB

teleporters

#include <bits/stdc++.h>
using namespace std;
int n,m,w[1000001],e[1000001],cnt[1000001],p[2000001],nxt[2000001],res;
int main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> n >> m;
    for (int i=0;i<n;i++){
        cin >> w[i] >> e[i];
        p[w[i]]=p[e[i]]=i;
        nxt[w[i]]=e[i];
        nxt[e[i]]=w[i];
    }
    int u=1;
    while (u<=2000000){
        if (p[u]){
            cnt[p[u]]++;
            res++;
            u=nxt[u];
        }
        u++;
    }
    priority_queue <int> q;
    int cur=0;
    for (int i=1;i<=2000000;i++)
        if (p[i]){
            if (cnt[p[i]]){
                q.push(cur);
                cur=0;
                continue;
            }
            cur++;
        }
    while (!q.empty()&&m){
        res+=q.top()+3;
        q.pop();
        m--;
    }
    int x=0;
    for (int i=1;i<=n;i++)
        x+=(cnt[i]==1);
    cout << res+3*min(m,x)+m-min(m,x)+(m-min(m,x))/2*2;
}

• Subtask 1: 0 / 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: 0 / 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