제출 #1029554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029554		12345678	Teleporters (IOI08_teleporters)	C++17	100 / 100	153 ms	25428 KiB

teleporters

#include <bits/stdc++.h>
 
using namespace std;
 
const int nx=1e6+5;
 
int n, m, u, v, mp[2*nx], p[2*nx], res, vs[2*nx], st, lst=-1, cnt[2*nx];
 
int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>u>>v, mp[u]=i, mp[v]=i+n;
    for (int i=2000005; i>=0; i--)
    {
        if (!mp[i]) continue;
        if (mp[i]>n) p[mp[i]-n]=lst;
        else p[mp[i]+n]=lst;
        lst=mp[i];
    }
    st=lst;
    while (st!=-1) vs[st]=1, res++, st=p[st];
    for (int i=1; i<=2*n; i++)
    {
        if (!vs[i])
        {
            int sz=1, tmp=i;
            while (p[tmp]!=i) vs[tmp]=1, sz++, tmp=p[tmp];
            vs[tmp]=1;
            cnt[sz]++;
        }
    }
    for (int i=2*n; i>=1; i--) while (m>0&&cnt[i]>0) res+=i+2, cnt[i]--, m--;
    res+=2*m;
    if (m%2) res--;
    cout<<res;
}

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