Submission #588290

#	Time	Username	Problem	Language	Result	Execution time	Memory
588290		Bench0310	Teleporters (IOI08_teleporters)	C++17	100 / 100	520 ms	42972 KiB

teleporters

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    vector<array<int,2>> v(2*n);
    vector<int> p(2*n,-1);
    for(int i=0;i<n;i++)
    {
        int l,r;
        cin >> l >> r;
        v[2*i]={l,2*i};
        v[2*i+1]={r,2*i+1};
    }
    sort(v.begin(),v.end());
    for(int i=0;i+1<2*n;i++) p[v[i][1]^1]=v[i+1][1];
    vector<bool> vis(2*n,0);
    vector<int> opt;
    int res=0;
    for(int i=0;i<2*n;i++)
    {
        int a=v[i][1];
        if(vis[a]) continue;
        int len=0;
        while(a!=-1&&!vis[a])
        {
            len++;
            vis[a]=1;
            a=p[a];
        }
        if(a!=-1) opt.push_back(len);
        else res+=len;
    }
    sort(opt.begin(),opt.end(),greater<>());
    for(int len:opt)
    {
        if(m>0)
        {
            res+=(len+2);
            m--;
        }
    }
    res+=(4*(m/2));
    if(m&1) res++;
    cout << res << "\n";
    return 0;
}

• 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