Submission #517042

# Submission time Handle Problem Language Result Execution time Memory
517042 2022-01-22T12:38:12 Z Be_dos Table Tennis (info1cup20_tabletennis) C++17
0 / 100
116 ms 15012 KB
#include <iostream>
#include <cmath>
#include <cctype>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <stack>
#include <unordered_set>
#include <sstream>
#include <cstring>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <random>
#include <cfloat>
#include <chrono>
#include <bitset>
#include <complex>
#include <immintrin.h>
#include <cassert>

int32_t get_matches(int32_t n, int32_t* arr1, int32_t* arr2) {
    int32_t ans = 0;
    int32_t ptr1 = 0, ptr2 = 0;
    while(ptr1 < n || ptr2 < n) {
        if(arr1[ptr1] == arr2[ptr2]) {
            ans++;
            ptr1++;
            ptr2++;
        } else if(arr1[ptr1] < arr2[ptr2])
            ptr1++;
        else
            ptr2++;
    }
    return ans;
}

int main() {
    int32_t n, k;
    std::cin >> n >> k;
    n += k;

    int32_t* arr = new int32_t[n];
    for(int32_t i = 0; i < n; i++)
        std::cin >> arr[i];

    int32_t** per_start = new int32_t*[k + 1];
    for(int32_t i = 0; i <= k; i++) {
        per_start[i] = new int32_t[n];
        for(int32_t j = 0; j < n; j++)
            per_start[i][j] = arr[j] - arr[i];
    }
    int32_t** per_end = new int32_t*[k + 1];
    for(int32_t i = 0; i <= k; i++) {
        per_end[i] = new int32_t[n];
        for(int32_t j = 0; j < n; j++)
            per_end[i][j] = arr[n - i - 1] - arr[j];
        std::reverse(per_end[i], per_end[i] + n);
    }

    for(int32_t i = 0; i <= k; i++)
        for(int32_t j = 0;j <= k; j++) {
            int32_t matches = get_matches(n, per_start[i], per_end[j]);
            if(matches >= n - k) {
                int32_t true_sum = arr[i] + arr[n - j - 1];
                std::map<int32_t, int32_t> freq;
                for(int32_t p = 0; p < n; p++)
                    freq[arr[p]]++;

                std::vector<int32_t> ans;
                for(int32_t p = 0; p < n; p++)
                    if(arr[p] * 2 < true_sum && freq[true_sum - arr[p]] > 0) {
                        ans.push_back(arr[p]);
                        ans.push_back(true_sum - arr[p]);
                        freq[true_sum - arr[p]]--;
                    } else if(arr[p] * 2 == true_sum && freq[true_sum - arr[p]] > 1) {
                        ans.push_back(arr[p]);
                        ans.push_back(true_sum - arr[p]);
                        freq[true_sum - arr[p]]-=2;
                    }

                for(int32_t p = 0; p < n - k; p++)
                    std::cout << ans[p] << " ";
                return 0;
            }
        }
    return 0;
}
         
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 416 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 2116 KB Output not sorted
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 116 ms 15012 KB Output not sorted
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 588 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 288 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 3116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -