Submission #1305021

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305021		ulvix	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	19 ms	6604 KiB

tabletennis

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#ifdef ULVI
    #include "debug.hpp"
#else
    #define db(...)
    #define dbv(v)
    #define line()
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define enld endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll sz=2e5+100;
const ll mod=1e9+7;
const ll inf=1e18;
template<class T>
using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve(){
    ll n,k;
    cin>>n>>k;
    vector<pll> v(n+k);
    for(ll i=0;i<n+k;i++){
        cin>>v[i].ff;
        v[i].ss=i+1;
    }
    sort(all(v));
    for(ll i=0;i<=k;i++){
        ll l=i,r=i+n-1,u=1;
        while(l<r){
            if(v[l].ff+v[r].ff==v[i].ff+v[i+n-1].ff){
                l++;
                r--;
                continue;
            }
            u=0;
            break;
        }
        if(u){
            for(ll j=i;j<=i+n-1;j++) cout<<v[i].ff<<' ';
            return;
        }
    }
}

int main(){
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t=1;
    // cin>>t;
    for(ll _=1;_<=t;_++){
        // cout<<"Scenario #"<<_<<":\n";
        solve();
    }
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 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