제출 #218281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
218281		tatyam	Teleporters (IOI08_teleporters)	C++17	100 / 100	975 ms	54248 KiB

teleporters

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define rep(a) for(int i = 0; i < a; i++)
#define each(i,a) for(auto&& i : a)
#define all(a) begin(a), end(a)


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector<pii> a(n);
    vector<int> x;
    each(i, a){
        int a, b;
        cin >> a >> b;
        i = {a, b};
        x.push_back(a);
        x.push_back(b);
    }
    sort(all(x));
    x.erase(unique(all(x)), x.end());
    vector<int> to(n * 2);
    each(i, a){
        i.first = lower_bound(all(x), i.first) - x.begin();
        i.second = lower_bound(all(x), i.second) - x.begin();
        to[i.first] = i.second;
        to[i.second] = i.first;
    }
    vector<int> color(n * 2, -1), cnt;
    int at = 0, c = 0, ans = 0;
    while(at != n * 2){
        color[at] = c;
        ans++;
        at = to[at] + 1;
    }
    rep(n * 2) if(color[i] == -1){
        cnt.push_back(0);
        int at = i; c++;
        while(at != n * 2 && color[at] == -1){
            color[at] = c;
            cnt.back()++;
            at = to[at] + 1;
        }
    }
    sort(all(cnt));
    while(cnt.size() && m){
        ans += cnt.back() + 2;
        cnt.pop_back();
        m--;
    }
    ans += m / 2 * 4 + m % 2;
    cout << ans << endl;
}

• 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