제출 #448631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448631		prvocislo	Teleporters (IOI08_teleporters)	C++17	100 / 100	557 ms	42824 KiB

teleporters

#include <iostream>
#include <vector>
#include <algorithm>
typedef long long ll;
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<pair<int, int> > v(2 * n + 2);
    v[0] = { 0, 0 }, v[1] = { 2e6 + 5, 1 };
    for (int i = 1; i <= n; i++)
    {
        cin >> v[2 * i].first >> v[2 * i + 1].first;
        v[2 * i].second = 2 * i, v[2 * i + 1].second = 2 * i + 1;
    }
    sort(v.begin(), v.end());
    int last = v.back().second;
    int k = v.size();
    vector<int> nx(k, -1);
    for (int i = k - 1; i >= 0; i--)
    {
        nx[v[i].second] = (last < 2 ? last : last ^ 1);
        last = v[i].second;
    }
    vector<bool> vis(k, false);
    int path = -1; vector<int> c;
    for (int i = 0; i < k; i++) if (!vis[i])
    {
        int j = i, len = 0;
        while (!vis[j])
        {
            vis[j] = true;
            len++, j = nx[j];
        }
        if (!i) path = len-2;
        else c.push_back(len);
    }
    sort(c.begin(), c.end());
    while (m && c.size())
    {
        path += c.back() + 2;
        c.pop_back(); m--;
    }
    path += ((m >> 1) << 2) + (m & 1);
    cout << path << "\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