제출 #485684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
485684		kym	Table Tennis (info1cup20_tabletennis)	C++14	87 / 100	3074 ms	128948 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = 150405;
int n,k;
int A[MAXN];
int nk;
void tryy(int ss) {
	set<int>s ;
	FOR(i,1,nk) {
		s.insert(A[i]);
	}
	int f=0;
	vector<int> out;
	FOR(i,1,nk) {
		int req=ss-A[i];
		if(s.find(req) != s.end()) {
			pi p;
			s.erase(s.find(A[i]));
			if(s.find(req)!=s.end()){
				s.erase(s.find(req));
				f+=2;
				out.pb(A[i]); 
				out.pb(req);
			}
		}
		if(f==n) {
			sort(all(out));
			for(auto i:out) cout << i << ' ';
			exit(0);
		}
	}
}

int32_t main() 
{
	IAMSPEED
	cin >> n >> k;
	nk=n+k;
	FOR(i,1,nk)cin >> A[i];
	sort(A+1,A+nk+1);
	if(nk*nk<=500000) {
		set<int> sums;
		FOR(i,1,nk) {
			FOR(j,1,i-1) {
				sums.insert(A[i]+A[j]);
			}
		}
		for(auto i:sums)tryy(i);
	} else {
		map<int,int>mp;
		FOR(i,1,nk) {
			if(i>=nk/2){
				
				int st=nk-i+1-k;
				int en=nk-i+1+k;
				FOR(j,max(0ll,st),min(nk,en))mp[A[j]+A[i]]++;
			} else {
				int dif=nk-i+1;
				int st=dif-k-1;
				int en=dif+k+1;
				FOR(j,max(0ll,st),min(nk,en))mp[A[j]+A[i]]++;
			}
		}
		vector<pi> v;
		for(auto i:mp)v.pb(i);
		sort(all(v),[](pi a, pi b) {
			return a.s>b.s;
		});
		tryy(v[0].f);
	}
}

• 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: 0 / 13