#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
void program();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
program();
}
//===================//
// begin program //
//===================//
const int MX = 5e5;
const int N = (1<<20);
int n, k, m;
int a[MX], b[MX];
bool exists(int i) {
return *(lower_bound(a,a+m,i)) == i;
}
bool check(int x) {
int cnt = 0;
RE(i,m) {
if(x-a[i] <= a[i]) break;
if(exists(x-a[i])) cnt += 2;
}
return cnt>=n;
}
void program() {
IN(n,k); m=n+k;
RE(i,m) IN(a[i]);
map<int,int> mp;
int y = min(k+2,m);
RE(i,y) RE(j,y) mp[a[i]+a[m-j-1]]++;
vii v;
FOR(p,mp) v.pb({p.se, p.fi});
sort(all(v), greater<ii>());
FOR(p,v) if(check(p.se)) {
int x = p.se;
vi ans;
RE(i,m) {
if(x-a[i] <= a[i]) break;
if(exists(x-a[i])) ans.pb(a[i]), ans.pb(x-a[i]);
if(ans.size() == n) break;
}
sort(all(ans));
OUTL(ans);
return;
}
OUTL("huh?");
}
Compilation message
tabletennis.cpp: In function 'void program()':
tabletennis.cpp:97:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
97 | if(ans.size() == n) break;
| ~~~~~~~~~~~^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
352 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
716 KB |
Output is correct |
2 |
Correct |
47 ms |
3076 KB |
Output is correct |
3 |
Correct |
51 ms |
3108 KB |
Output is correct |
4 |
Correct |
47 ms |
3132 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
3080 KB |
Output is correct |
2 |
Correct |
55 ms |
3028 KB |
Output is correct |
3 |
Correct |
50 ms |
3132 KB |
Output is correct |
4 |
Correct |
56 ms |
3124 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
928 KB |
Output is correct |
2 |
Correct |
3 ms |
972 KB |
Output is correct |
3 |
Correct |
4 ms |
972 KB |
Output is correct |
4 |
Correct |
3 ms |
716 KB |
Output is correct |
5 |
Correct |
4 ms |
972 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
332 KB |
Output is correct |
5 |
Correct |
2 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
51 ms |
3076 KB |
Output is correct |
3 |
Correct |
113 ms |
4464 KB |
Output is correct |
4 |
Correct |
61 ms |
4508 KB |
Output is correct |
5 |
Correct |
78 ms |
4540 KB |
Output is correct |
6 |
Correct |
48 ms |
4580 KB |
Output is correct |
7 |
Correct |
56 ms |
4580 KB |
Output is correct |
8 |
Correct |
48 ms |
4548 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
295 ms |
5764 KB |
Output is correct |
2 |
Correct |
101 ms |
12488 KB |
Output is correct |
3 |
Correct |
106 ms |
12948 KB |
Output is correct |
4 |
Correct |
85 ms |
11312 KB |
Output is correct |
5 |
Correct |
813 ms |
7076 KB |
Output is correct |
6 |
Correct |
54 ms |
4700 KB |
Output is correct |
7 |
Correct |
86 ms |
10564 KB |
Output is correct |
8 |
Correct |
92 ms |
12976 KB |
Output is correct |