oj.uz

Submission #785330

# Submission time Handle Problem Language Result Execution time Memory
785330 2023-07-17T08:26:42 Z Zanite Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 116 ms 11300 KB 
// 赤コーダーになりたい
// お願い いいですか？

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

// Pragmas
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Namespaces
using namespace std;
using namespace __gnu_pbds;

// Data types
using si	= short int;
using ll	= long long;
using lll	= __int128;
using ld	= long double;

// Pairs
using pii	= pair<int, int>;
using psi	= pair<si, si>;
using pll	= pair<ll, ll>;
using plll	= pair<lll, lll>;
using pld	= pair<ld, ld>;
#define fi	first
#define se	second

// For
#define Frue(i, n, N)		for (int i = (n); i <= (N); i++)
#define  Fru(i, n, N)		for (int i = (n); i <  (N); i++)
#define Frde(i, n, N)		for (int i = (n); i >= (N); i--)
#define  Frd(i, n, N)		for (int i = (n); i >  (N); i--)

// PBDS
template<typename Z>
using ordered_set	= tree<Z, null_type, less<Z>, rb_tree_tag, tree_order_statistics_node_update>;

// Various outputs
template<typename Y, typename Z> ostream& operator<<(ostream &os, const pair<Y, Z> &p) {
	return os << '(' << p.fi << ',' << p.se << ')';
}
template<typename Z> ostream& operator<<(ostream &os, const vector<Z> &v) {
	os << '{'; bool _first = 1;
	for (auto &i : v) {if (!_first) os << ", "; os << i; _first = 0;}
	return os << '}';
}
template<typename Z, unsigned long long sz> ostream& operator<<(ostream &os, const array<Z, sz> &arr) {
	os << '{'; bool _first = 1;
	for (auto &i : arr) {if (!_first) os << ", "; os << i; _first = 0;}
	return os << '}';
}

// Quick macro functions
#define sqr(x)			((x)*(x))
#define debug(x)		cout << #x << " = " << (x) << '\n'
#define debugV(v, x)	cout << #v << "[" << (x) << "] = " << (v[x]) << '\n'
#define rrebug(x)		cerr << #x << " = " << (x) << '\n'
#define rrebugV(v, x)	cerr << #v << "[" << (x) << "] = " << (v[x]) << '\n'

#define All(x)			x.begin(), x.end()
#define Sort(x)			sort(All(x))
#define Reverse(x)		reverse(All(x))
#define Uniqueify(x)	Sort(x); x.erase(unique(All(x)), x.end())

#define RandomSeed			chrono::steady_clock::now().time_since_epoch().count()
#define MultipleTestcases	int _tc; cin >> _tc; for (int _cur_tc = 1; _cur_tc <= _tc; _cur_tc++)

// Check min and max
template<typename Z> void chmin(Z &a, Z b) {a = min(a, b);}
template<typename Z> void chmax(Z &a, Z b) {a = max(a, b);}
 
// Modular arithmetic
template<int MOD>
class ModInt {
  public:
	int v;
	ModInt() : v(0) {}
	ModInt(long long _v) {
		v = int((-MOD < _v && _v < MOD) ? (_v) : (_v % MOD));
		if (v < 0) v += MOD;
	}
 
	friend bool operator==(const ModInt &a, const ModInt &b) {return a.v == b.v;}
	friend bool operator!=(const ModInt &a, const ModInt &b) {return a.v != b.v;}
	friend bool operator< (const ModInt &a, const ModInt &b) {return a.v <  b.v;}
	friend bool operator<=(const ModInt &a, const ModInt &b) {return a.v <= b.v;}
	friend bool operator> (const ModInt &a, const ModInt &b) {return a.v >  b.v;}
	friend bool operator>=(const ModInt &a, const ModInt &b) {return a.v >= b.v;}
 
	ModInt &operator+=(const ModInt &a) {if ((v += a.v) >= MOD) v -= MOD; return *this;}
	ModInt &operator-=(const ModInt &a) {if ((v -= a.v) < 0) v += MOD; return *this;}
	ModInt &operator*=(const ModInt &a) {v = 1ll * v * a.v % MOD; return *this;}
	ModInt &operator/=(const ModInt &a) {return (*this) *= inverse(a);}
 
	friend ModInt pow(ModInt a, long long x) {
		ModInt res = 1;
		for (; x; x /= 2, a *= a) if (x & 1) res *= a;
		return res;
	}
	friend ModInt inverse(ModInt a) {return pow(a, MOD - 2);}
 
	ModInt operator+ () const {return ModInt( v);}
	ModInt operator- () const {return ModInt(-v);}
	ModInt operator++() const {return *this += 1;}
	ModInt operator--() const {return *this -= 1;}
 
	friend ModInt operator+(ModInt a, const ModInt &b) {return a += b;}
	friend ModInt operator-(ModInt a, const ModInt &b) {return a -= b;}
	friend ModInt operator*(ModInt a, const ModInt &b) {return a *= b;}
	friend ModInt operator/(ModInt a, const ModInt &b) {return a /= b;}
 
	friend istream &operator>>(istream &is, ModInt &v) {return is >> v.v;}
	friend ostream &operator<<(ostream &os, const ModInt &v) {return os << v.v;}
};
const int ModA	= 998244353;
const int ModC	= 1e9 + 7;
using MintA	= ModInt<ModA>;
using MintC	= ModInt<ModC>;

// Other constants
const ll INF	= 1e18;
const ll iINF	= 1e9;
const ld EPS	= 1e-9;
const ld iEPS	= 1e-6;

const int maxN	= 2e5 + 5;

int N, K, A[maxN];

vector<int> BruteCandidates() {
	vector<int> ret;
	for (int i = 1; i <= N; i++) {
		for (int j = i + 1; j <= N; j++) {
			ret.push_back(A[i] + A[j]);
		}
	}
	Uniqueify(ret);
	return ret;
}

vector<int> SolveCandidates() {
	map<int, int> freq;
	for (int i = 1; i <= K+1; i++) {
		for (int j = N; j >= N-K; j--) {
			freq[A[i] + A[j]] = 0;
		}
	}
	for (int i = 1; i <= K+K; i++) {
		for (int j = N; j >= N-K-K+1; j--) {
			if (freq.count(A[i] + A[j])) {
				freq[A[i] + A[j]]++;
			}
		}
	}
	vector<int> ret;
	for (auto &[idx, val] : freq) {
		if (val >= K) ret.push_back(idx);
	}
	return ret;
}

vector<int> Construct(int sum) {
	vector<int> tl, tr;
	int cnt = 0;
	for (int L = 1, R = N; L < R; ) {
		int cur = A[L] + A[R];
		if (cur == sum) {
			tl.push_back(A[L++]);
			tr.push_back(A[R--]);
			cnt += 2;
		} else if (cur < sum) {
			L++;
		} else {
			R--;
		}
		if (cnt == N-K) break;
	}

	if (cnt < N-K) {
		return {};
	} else {
		Reverse(tr);
		for (auto i : tr) tl.push_back(i);
		return tl;
	}
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);

	cin >> N >> K;
	N += K;
	for (int i = 1; i <= N; i++) cin >> A[i];

	vector<int> candidates;
	if (N < 4*K) {
		candidates = BruteCandidates();
	} else {
		candidates = SolveCandidates();
	}
	// debug(candidates);

	for (auto sum : candidates) {
		vector<int> ans = Construct(sum);
		if (!ans.empty()) {
			for (auto i : ans) cout << i << ' ';
			cout << '\n';
			exit(0);
		}
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 804 KB Output is correct
2 Correct 22 ms 3180 KB Output is correct
3 Correct 21 ms 4560 KB Output is correct
4 Correct 21 ms 4636 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3228 KB Output is correct
2 Correct 21 ms 3212 KB Output is correct
3 Correct 21 ms 4596 KB Output is correct
4 Correct 24 ms 4640 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 360 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 21 ms 3220 KB Output is correct
3 Correct 22 ms 4608 KB Output is correct
4 Correct 26 ms 4460 KB Output is correct
5 Correct 28 ms 4648 KB Output is correct
6 Correct 26 ms 4592 KB Output is correct
7 Correct 30 ms 4584 KB Output is correct
8 Correct 23 ms 4456 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 984 KB Output is correct
2 Correct 114 ms 9616 KB Output is correct
3 Correct 116 ms 11300 KB Output is correct
4 Correct 84 ms 10008 KB Output is correct
5 Correct 112 ms 7212 KB Output is correct
6 Correct 62 ms 4696 KB Output is correct
7 Correct 89 ms 9036 KB Output is correct
8 Correct 80 ms 10240 KB Output is correct