Submission #667661

#	Time	Username	Problem	Language	Result	Execution time	Memory
667661		LFFB	Table Tennis (info1cup20_tabletennis)	C++14	20 / 100	80 ms	2480 KiB

tabletennis

#include <iostream>
#include <algorithm>

#define debug(args...) //printf(args)

const int MAX_M = 16e4;
typedef long long llong;

int n, m, k;
int input[MAX_M];

int main() {

    scanf("%d %d", &n, &k);
    if (k != 1) return 1;
    m = n + k;
    for (int i = 0; i < m; i++) {
        scanf("%d", &input[i]);
    }

    std::sort(input, input+m);

    int bad = -1;

    // find bad one
    for (int x = 0; x < m; x++) {

        debug("at x = %d\n", x);

        int i = 0;
        int j = m-1;
        if (i == x) i++;
        if (j == x) j--;
        int sum = input[i] + input[j];

        bool valid = true;

        while (valid) {
            if (j < i) break;
            if (input[i] + input[j] != sum) {
                debug("i=%d, j=%d, %d + %d != %d\n", i, j, input[i], input[j], sum);
                valid = false;
            }
            i++;
            j--;
            if (i == x) i++;
            if (j == x) j--;
        }

        if (valid) {
            bad = input[x];
            debug("bad = input[%d] = %d\n", x, input[x]);
            break;
        }

    }

    for (int i = 0; i < m; i++) {
        if (input[i] == bad) continue;
        printf("%d ", input[i]);
    }
    printf("\n");

}

Compilation message (stderr)

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

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13