oj.uz

Submission #222164

# Submission time Handle Problem Language Result Execution time Memory
222164 2020-04-12T09:25:04 Z ryansee Table Tennis (info1cup20_tabletennis) C++14
72 / 100
 3000 ms 269572 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return (rng() % (y+1-x)) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
 
typedef int ll; 
typedef long double ld;
#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)
typedef pair<ll,ll>pi; typedef pair<ll,pi>spi; typedef pair<pi,pi>dpi;
 
#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (200006)
ll n,k,A[MAXN];
bitset<MAXN> taken;
unordered_map<ll,ll> mp;
int main(){
	FAST
	cin>>n>>k;
	n+=k;
	FOR(i,1,n)cin>>A[i],mp[A[i]]=i;
	vector<ll> ppl;
	auto tryy=[&](ll a,ll b){
		ppl.clear();
		taken.reset();
		ll sum=A[a]+A[b];
		ppl.eb(A[a]), ppl.eb(A[b]);
		taken[a]=taken[b]=1;
		FOR(i,a+1,b-1)if(!taken[i])if(ppl.size()<n-k){
			if(mp[sum-A[i]]>i) {
				ppl.eb(A[i]), ppl.eb(sum-A[i]);
				taken[i]=taken[mp[sum-A[i]]]=1;
			}
		}
		if(ppl.size()==n-k)return 1;
		else return 0;
	};
	vector<pi> v;
	FOR(i,1,k+1) DEC(j,n,n-k) if(i<=j && i-1+n-j<=k) v.eb(i,j); 
	shuffle(all(v),rng);
	for(auto hmm:v) {
		ll i=hmm.f, j=hmm.s;
		if(tryy(i,j)){
			sort(all(ppl));
			for(auto i:ppl) cout<<i<<' ';cout<<'\n';
			return 0;
		}
	}
	assert(0);
}

Compilation message

tabletennis.cpp: In lambda function:
tabletennis.cpp:44:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   FOR(i,a+1,b-1)if(!taken[i])if(ppl.size()<n-k){
                                 ~~~~~~~~~~^~~~
tabletennis.cpp:50:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(ppl.size()==n-k)return 1;
      ~~~~~~~~~~^~~~~
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:60:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for(auto i:ppl) cout<<i<<' ';cout<<'\n';
    ^~~
tabletennis.cpp:60:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for(auto i:ppl) cout<<i<<' ';cout<<'\n';
                                 ^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1792 KB Output is correct
2 Correct 254 ms 25604 KB Output is correct
3 Correct 157 ms 17288 KB Output is correct
4 Correct 244 ms 25604 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 31852 KB Output is correct
2 Correct 429 ms 39400 KB Output is correct
3 Correct 78 ms 10556 KB Output is correct
4 Correct 80 ms 10556 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 6588 KB Output is correct
2 Correct 56 ms 8632 KB Output is correct
3 Correct 23 ms 4368 KB Output is correct
4 Correct 35 ms 7100 KB Output is correct
5 Correct 49 ms 7740 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 20 ms 6416 KB Output is correct
3 Correct 126 ms 16004 KB Output is correct
4 Correct 92 ms 14216 KB Output is correct
5 Correct 17 ms 2224 KB Output is correct
6 Correct 5 ms 512 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 435 ms 39296 KB Output is correct
3 Execution timed out 3095 ms 269572 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2715 ms 205968 KB Output is correct
2 Execution timed out 3107 ms 261752 KB Time limit exceeded
3 Halted 0 ms 0 KB -