Submission #471269

#	Time	Username	Problem	Language	Result	Execution time	Memory
471269		NhatMinh0208	Table Tennis (info1cup20_tabletennis)	C++14	100 / 100	408 ms	33732 KiB

tabletennis

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b,l,r;
int arr[160001];
int yes[160001];
map<int,int> app;
int main()
{
    srand(1);
	fio;
    cin>>n>>m;

    for (i=0;i<n+m;i++) {
        cin>>arr[i];
    }

    if (n<3*m) {
        for (i=0;i<=m;i++) for (j=max(i+1,n-1);j<n+m;j++) if (i-1+n-j<=0) {
            u=arr[i]+arr[j];
            v=1;
            l=i+1;
            r=j-1;
            while (l<r) {
                if (arr[l]+arr[r]==u) {
                    v++;
                    l++;
                    r--;
                } else if (arr[l]+arr[r]>u) {
                    r--;
                } else {
                    l++;
                }
            }
            if (v>=n/2) {
                v=1;
                l=i+1;
                r=j-1;
                yes[l-1]=1;
                yes[r+1]=1;
                while (l<r && v<n/2) {
                    if (arr[l]+arr[r]==u) {
                        v++;
                        yes[l]=1;
                        yes[r]=1;
                        l++;
                        r--;
                    } else if (arr[l]+arr[r]>u) {
                        r--;
                    } else {
                        l++;
                    }
                }
                for (k=0;k<n+m;k++) {
                    if (yes[k]) cout<<arr[k]<<' ';
                }
                return 0;
            }
        }
    } else {
        for (i=0;i<2*m;i++) for (j=max(i+1,n-m);j<n+m;j++) {
            app[arr[i]+arr[j]]++;
        }
        for (auto g : app) if (g.se>=m) {
            u=g.fi;
            v=0;
            l=0;
            r=m+n-1;
            while (l<r) {
                if (arr[l]+arr[r]==u) {
                    v++;
                    l++;
                    r--;
                } else if (arr[l]+arr[r]>u) {
                    r--;
                } else {
                    l++;
                }
            }
            if (v>=n/2) {
                v=0;
                l=0;
                r=m+n-1;
                while (l<r && v<n/2) {
                    if (arr[l]+arr[r]==u) {
                        v++;
                        yes[l]=1;
                        yes[r]=1;
                        l++;
                        r--;
                    } else if (arr[l]+arr[r]>u) {
                        r--;
                    } else {
                        l++;
                    }
                }
                for (k=0;k<n+m;k++) {
                    if (yes[k]) cout<<arr[k]<<' ';
                }
                return 0;
            }
        }
    }
    assert(0);
}
// Normie28;

Compilation message (stderr)

tabletennis.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

• 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