oj.uz

Submission #56485

# Submission time Handle Problem Language Result Execution time Memory
56485 2018-07-11T12:58:11 Z aquablitz11 Teleporters (IOI08_teleporters) C++14
95 / 100
 879 ms 66560 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1000002;

int n, m;
int A[N], B[N], pos[2*N], coord[2*N], nxt[2*N], cc;

int comp(const void *a, const void *b) {
    return *(int*)a - *(int*)b;
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; ++i) {
        scanf("%d%d", &A[i], &B[i]);
        coord[2*i+1] = A[i];
        coord[2*i+2] = B[i];
    }
    sort(coord, coord+2*n+1);
    for (int i = 0; i < 2*n+1; ++i)
        pos[coord[i]] = i;
    for (int i = 0; i < n; ++i) {
        nxt[pos[A[i]]-1] = pos[B[i]];
        nxt[pos[B[i]]-1] = pos[A[i]];
    }
    for (int i = 0; i < 2*n+1; ++i)
        pos[i] = 0;

    int ans = 0;
    for (int s = 0; s < 2*n; ++s) {
        if (pos[s]) continue;
        for (int u = s, c = 1; ; ++c) {
            pos[u] = 1;
            u = nxt[u];
            if (pos[u]) {
                A[cc++] = c;
                break;
            } else if (u == 2*n) {
                ans = c;
                break;
            }
        }
    }
    qsort(A, cc, sizeof(int), comp);
    while (m--) {
        if (cc > 0) {
            ans += A[--cc]+2;
        } else {
            ++ans;
            A[cc++] = 1;
        }
    }
    printf("%d\n", ans);

    return 0;
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
teleporters.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &A[i], &B[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 744 KB Output is correct
2 Correct 14 ms 1000 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1000 KB Output is correct
2 Correct 9 ms 1260 KB Output is correct
3 Correct 18 ms 1520 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 5732 KB Output is correct
2 Correct 239 ms 14484 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 14484 KB Output is correct
2 Correct 338 ms 19396 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 24728 KB Output is correct
2 Correct 693 ms 28000 KB Output is correct
3 Correct 577 ms 29608 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 874 ms 30548 KB Output is correct
2 Correct 722 ms 32752 KB Output is correct
3 Correct 654 ms 46056 KB Output is correct
4 Correct 763 ms 61016 KB Output is correct

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 814 ms 63524 KB Output is correct
2 Runtime error 879 ms 66560 KB Memory limit exceeded 66560 {'time-wall': '0.930', 'max-rss': '35392', 'csw-forced': '189', 'cg-mem': '66560', 'time': '0.879', 'csw-voluntary': '7'} 65536
3 Halted 0 ms 0 KB -