제출 #222142

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
222142		ryansee	Table Tennis (info1cup20_tabletennis)	C++14	72 / 100	3111 ms	414516 KiB

tabletennis

#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 long long 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;
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);
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13