oj.uz

Submission #556747

# Submission time Handle Problem Language Result Execution time Memory
556747 2022-05-03T21:31:33 Z timreizin Teleporters (IOI08_teleporters) C++17
100 / 100
 995 ms 54408 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <string>
#include <numeric>
#include <cmath>
#include <cassert>
#include <array>
#include <numeric>

using namespace std;

using ll = long long;

int dfs2(int v, vector<int> &adj, vector<bool> &used)
{
    used[v] = true;
    if (adj[v] == -1 || used[adj[v]]) return 1;
    return dfs2(adj[v], adj, used) + 1;
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> we(n);
    vector<pair<int, int>> closest;
    for (int i = 0; i < n; ++i)
    {
        cin >> we[i].first >> we[i].second;
        closest.push_back({we[i].first, i * 2});
        closest.push_back({we[i].second, i * 2 + 1});
    }
    sort(closest.begin(), closest.end());
    vector<int> adj(2 * n, -1);
    for (int i = 0; i < n; ++i)
    {
        auto it = upper_bound(closest.begin(), closest.end(), pair(we[i].second, (int)1e9));
        if (it != closest.end()) adj[2 * i] = it->second;
        it = upper_bound(closest.begin(), closest.end(), pair(we[i].first, (int)1e9));
        if (it != closest.end()) adj[2 * i + 1] = it->second;
    }
    int start = closest.front().second;
    vector<bool> used(2 * n);
    auto dfs = [&adj, &used](auto self, int v) -> int
    {
        used[v] = true;
        if (adj[v] == -1 || used[adj[v]]) return 1;
        return self(self, adj[v]) + 1;
    };
    int res = dfs2(start, adj, used);
    vector<int> comps;
    for (int i = 0; i < 2 * n; ++i) if (!used[i]) comps.push_back(dfs2(i, adj, used));
    sort(comps.rbegin(), comps.rend());
    for (int i = 0; i < min(m, (int)comps.size()); ++i) res += comps[i] + 2;
    m -= (int)comps.size();
    m = max(m, 0);
    res += 2 * (m - m % 2);
    res += m % 2;
    cout << res;
    return 0;
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:48:10: warning: variable 'dfs' set but not used [-Wunused-but-set-variable]
   48 |     auto dfs = [&adj, &used](auto self, int v) -> int
      |          ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 6 ms 724 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 7 ms 724 KB Output is correct
3 Correct 27 ms 1236 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 724 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1104 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 4768 KB Output is correct
2 Correct 261 ms 11004 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 7836 KB Output is correct
2 Correct 393 ms 15444 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 23672 KB Output is correct
2 Correct 674 ms 27900 KB Output is correct
3 Correct 729 ms 33580 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 863 ms 31416 KB Output is correct
2 Correct 896 ms 34244 KB Output is correct
3 Correct 928 ms 31380 KB Output is correct
4 Correct 937 ms 31768 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 995 ms 38424 KB Output is correct
2 Correct 957 ms 53396 KB Output is correct
3 Correct 485 ms 54400 KB Output is correct
4 Correct 921 ms 54408 KB Output is correct