oj.uz

Submission #485683

# Submission time Handle Problem Language Result Execution time Memory
485683 2021-11-09T01:06:33 Z kym Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 129760 KB 
#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;
		});
		FOR(i,0,min((int)v.size(),2ll))tryy(v[i].f);
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1612 KB Output is correct
2 Correct 138 ms 11972 KB Output is correct
3 Correct 146 ms 12024 KB Output is correct
4 Correct 143 ms 11916 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 9944 KB Output is correct
2 Correct 93 ms 10756 KB Output is correct
3 Correct 86 ms 10052 KB Output is correct
4 Correct 96 ms 10768 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 206 ms 988 KB Output is correct
3 Correct 5 ms 972 KB Output is correct
4 Correct 98 ms 1016 KB Output is correct
5 Correct 5 ms 972 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 18 ms 3800 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2107 ms 25440 KB Output is correct
3 Correct 890 ms 25900 KB Output is correct
4 Correct 264 ms 11512 KB Output is correct
5 Correct 766 ms 25540 KB Output is correct
6 Correct 171 ms 10016 KB Output is correct
7 Correct 296 ms 10412 KB Output is correct
8 Correct 276 ms 11428 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 4556 KB Output is correct
2 Execution timed out 3075 ms 129760 KB Time limit exceeded
3 Halted 0 ms 0 KB -