Submission #56486

#	Time	Username	Problem	Language	Result	Execution time	Memory
56486		aquablitz11	Teleporters (IOI08_teleporters)	C11	95 / 100	934 ms	66560 KiB

teleporters

#include <stdio.h>
#include <stdlib.h>

#define 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];
    }
    qsort(coord, 2*n+1, sizeof(int), comp);
    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 (stderr)

teleporters.c: In function 'main':
teleporters.c:15:5: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ^~~~~~~~~~~~~~~~~~~~~
teleporters.c:17:9: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &A[i], &B[i]);
         ^~~~~~~~~~~~~~~~~~~~~~~~~~~

• 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: 0 / 5