oj.uz

Submission #407192

# Submission time Handle Problem Language Result Execution time Memory
407192 2021-05-18T15:35:04 Z Aldas25 Teleporters (IOI08_teleporters) C++14
100 / 100
 546 ms 56176 KB 
#pragma GCC optimize("O2")

#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<piii> viii;

const int MAXN = 2000100, MAXK = 30;
//const ll MOD = 998244353;
const ll INF = 1e17;
const ld PI = asin(1) * 2;

int n, m;
vii seq;
//unordered_map<int, int> toId;
int id1[MAXN], id2[MAXN];
int to[MAXN];
vi lens;

bool vis[MAXN];
int len = 0;
void dfs (int v) {
    vis[v] = true;
    len++;
    if (!vis[to[v]])
        dfs(to[v]);
}

int main()
{
    FAST_IO;

    cin >> n >> m;
//    FOR(i, 1, n) cin >> w[i] >> e[i];
    FOR(i, 1, n) {
        int w, e;
         cin >> w >> e;
        seq.pb({w, 2*i});
        seq.pb({e, 2*i+1});
    }
    sort(seq.begin(), seq.end());

    FOR(i, 0, 2*n-1) {
        //int x = seq[i].f;
        int id = seq[i].s;
        if (id%2 == 0) {
            id /= 2;
            id1[id] = i+2;
        } else {
            id /= 2;
            id2[id] = i+2;
        }
    }

    FOR(i, 1, n) {
        //int id1 = toId[w[i]];
        //int id2 = toId[e[i]];
        to[id1[i]-1] = id2[i];
        to[id2[i]-1] = id1[i];
      //  cout << "  i = " << i << " w = " << w[i] << " e = " << e[i] << " id1 = " << id1 << " id2= " << id2 << endl;
    }

    //FOR(i, 1, 2*n+1) cout << " i = " << i << " to = " << to[i] << endl;

    vis[0] = true;

    ll ans = 0;
    FOR(i, 1, 2*n+1) {
        if (vis[i]) continue;
        len = 0;
        dfs(i);
        if (i == 1) {
            len--;
            ans = len;
        } else {
            lens.pb(len);
        }
    }
   // cout << "ans = " << ans << "\n";

    sort(lens.begin(), lens.end());
    reverse(lens.begin(), lens.end());

    for (int x : lens) {
        if (m == 0) break;
        m--;
        ans += x + 2;
      //  cout << " adding x+2;  x=" << x << endl;
    }

    int kk = m/2;
    m%=2;
    ans += 4*kk;
    if (m == 1) ans ++;

    cout << ans << "\n";

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 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 460 KB Output is correct
2 Correct 6 ms 720 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 6 ms 848 KB Output is correct
3 Correct 13 ms 1460 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 4944 KB Output is correct
2 Correct 152 ms 11304 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 8228 KB Output is correct
2 Correct 223 ms 16204 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 33904 KB Output is correct
2 Correct 384 ms 40340 KB Output is correct
3 Correct 403 ms 46620 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 38368 KB Output is correct
2 Correct 507 ms 49736 KB Output is correct
3 Correct 486 ms 47696 KB Output is correct
4 Correct 475 ms 48324 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 525 ms 47184 KB Output is correct
2 Correct 546 ms 55088 KB Output is correct
3 Correct 405 ms 56160 KB Output is correct
4 Correct 507 ms 56176 KB Output is correct