Submission #163449

#	Time	Username	Problem	Language	Result	Execution time	Memory
163449		dolphingarlic	Teleporters (IOI08_teleporters)	C++14	100 / 100	580 ms	52344 KiB

teleporters

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int has_end[2020202], to[2020202], pref[2020202];
pair<int, int> teleporters[2020202];

int cnt = 0, sizes[2020202];
bool visited[2020202];

void dfs(int node, int cycle) {
    visited[node] = true;
    sizes[cycle]++;
    if (!visited[to[node]]) dfs(to[node], cycle);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    FOR(i, 0, n) {
        int a, b;
        cin >> a >> b;
        has_end[a] = has_end[b] = 1;
        teleporters[i] = {a, b};
    }
    FOR(i, 1, 2020202) pref[i] = pref[i - 1] + has_end[i];
    FOR(i, 0, n) {
        to[pref[teleporters[i].first] - 1] = pref[teleporters[i].second];
        to[pref[teleporters[i].second] - 1] = pref[teleporters[i].first];
    }

    FOR(i, 0, 2 * n) if (!visited[i]) dfs(i, cnt++);
    sort(sizes + 1, sizes + cnt, greater<int>());
    for (int i = 1; i < cnt && m; i++, m--) sizes[0] += sizes[i] + 2;
    sizes[0] += (m / 2) * 4 + (m & 1);

    cout << sizes[0] - 1;
    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