oj.uz

Submission #503835

# Submission time Handle Problem Language Result Execution time Memory
503835 2022-01-09T03:06:40 Z tabr Teleporters (IOI08_teleporters) C++17
90 / 100
 631 ms 65540 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> a(n);
    vector<int> b(2 * n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
        b[2 * i] = a[i].first;
        b[2 * i + 1] = a[i].second;
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    for (int i = 0; i < n; i++) {
        a[i].first = (int) (lower_bound(b.begin(), b.end(), a[i].first) - b.begin());
        a[i].second = (int) (lower_bound(b.begin(), b.end(), a[i].second) - b.begin());
    }
    vector<int> c(2 * n);
    for (int i = 0; i < n; i++) {
        c[a[i].first] = a[i].second;
        c[a[i].second] = a[i].first;
    }
    vector<int> was(2 * n);
    vector<vector<int>> path;
    vector<int> d;
    for (int z = 0; z < 2 * n; z++) {
        if (was[z]) {
            continue;
        }
        int now = z;
        path.emplace_back();
        do {
            was[now] = 1;
            path.back().emplace_back(now);
            now = c[now] + 1;
        } while (now < 2 * n && now != z);
        if (path.size() > 1) {
            d.emplace_back((int) path.back().size());
        }
    }
    int ans = (int) path[0].size();
    sort(d.rbegin(), d.rend());
    debug(path);
    debug(d);
    int t = 0;
    for (int i = 0; i < m; i++) {
        if (i < (int) d.size()) {
            ans += d[i] + 2;
        } else if (t) {
            ans += 3;
            t ^= 1;
        } else {
            ans++;
            t ^= 1;
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 584 KB Output is correct
2 Correct 8 ms 1248 KB Output is correct
3 Correct 14 ms 1920 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 10192 KB Output is correct
2 Correct 181 ms 22992 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 17128 KB Output is correct
2 Correct 282 ms 31480 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 58380 KB Output is correct
2 Correct 469 ms 65536 KB Output is correct
3 Runtime error 452 ms 65536 KB Execution killed with signal 9

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 587 ms 65536 KB Output is correct
2 Correct 629 ms 65536 KB Output is correct
3 Correct 534 ms 53932 KB Output is correct
4 Correct 535 ms 54584 KB Output is correct

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 631 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -