제출 #904048

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
904048		Ice_man	Table Tennis (info1cup20_tabletennis)	C++14	100 / 100	293 ms	4548 KiB

tabletennis

#include <iostream>
#include <chrono>
#include <vector>
#include <algorithm>

#define maxn 200005
#define maxlog 20
#define INF 1000000010
#define LINF 1000000000000000005
#define endl '\n'
#define pb(x) push_back(x)
#define X first
#define Y second
#define control cout<<"passed"<<endl;

#pragma GCC optimize("O3" , "Ofast" , "unroll-loops" , "fast-math")
#pragma GCC target("avx2")

using namespace std;

std::chrono::high_resolution_clock::time_point startT, currT;
constexpr double TIME_MULT = 1;

double timePassed()
{
    using namespace std::chrono;
    currT = high_resolution_clock::now();
    double time = duration_cast<duration<double>>(currT - startT).count();
    return time * TIME_MULT;
}


int n , k;

int a[maxn];

void read()
{
    cin >> n >> k;

    for(int i = 0; i < n + k; i++)
        cin >> a[i];

}


void solve()
{
    vector <int> ans;
    ans.resize(n);

    int start = (n / 2) - 1;

    for(int i = start; i <= start + k; i++)
    {
        int pom = a[i] + a[i + 1];

        int l = 0 , r = n + k - 1;

        int j = 0;

        while(r > l && j < n / 2)
        {
            while(r > l && (a[l] + a[r]) > pom)
                r--;

            if(r > l && (a[l] + a[r]) == pom)
            {
                ans[j] = a[l];
                ans[n - j - 1] = a[r];
                j++;
            }

            l++;

        }

        if(n / 2 > j)
            continue;

        for(int e : ans)
            cout << e << " ";

        cout << endl;

        break;


    }

}


int main()
{

/**#ifdef ONLINE_JUDGE
    freopen("taxi.in", "r", stdin);
    freopen("taxi.out", "w", stdout);
#endif*/

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    startT = std::chrono::high_resolution_clock::now();

    read();
    solve();

    return 0;
}

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