oj.uz

Submission #675137

# Submission time Handle Problem Language Result Execution time Memory
675137 2022-12-27T02:09:59 Z hollwo_pelw Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 283 ms 32456 KB 
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;

void Hollwo_Pelw();

signed main(){
#ifndef hollwo_pelw_local
	if (fopen(".inp", "r"))
		assert(freopen(".inp", "r", stdin)), assert(freopen(".out", "w", stdout));
#else
	using namespace chrono;
	auto start = steady_clock::now();
#endif
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
	int testcases = 1;
	// cin >> testcases;
	for (int test = 1; test <= testcases; test++){
		// cout << "Case #" << test << ": ";
		Hollwo_Pelw();
	}
#ifdef hollwo_pelw_local
	auto end = steady_clock::now();
	cout << "\nExecution time : " << duration_cast<milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}

const int N = 2e5;

int n, k, a[N];

bool check(int sum) {
	int cnt = 0;
	vector<int> l, r;
	// cout << sum << '\n';
	for (int i = 1, j = n + k; i < j; i++) {
		while (j > i && a[j] + a[i] > sum) j --;
		if (j > i && a[j] + a[i] == sum) {
			cnt ++;
			l.push_back(a[i]);
			r.push_back(a[j]);
		}
	}

	if (cnt == n / 2) {
		reverse(r.begin(), r.end());
		for (int i : l)
			cout << i << ' ';
		for (int i : r)
			cout << i << ' ';
	}

	return cnt == n / 2;
}

void Hollwo_Pelw(){
	cin >> n >> k;
	for (int i = 1; i <= n + k; i++)
		cin >> a[i];
	
	map<int, int> cnt;

	if (4 * k > n) {
		for (int i = 1; i <= n + k; i++)
			for (int j = i + 1; j <= n + k; j++)
				cnt[a[i] + a[j]] ++;
		for (auto [v, c] : cnt) {
			if (c >= n / 2)
				if (check(v)) return;
		}
	}

	for (int i = 1; i <= 2 * k; i++) {
		for (int j = n - k + 1; j <= n + k; j++) {
			cnt[a[i] + a[j]] ++;
		}
	}

	for (auto [v, c] : cnt) {
		if (c >= k)
			if (check(v)) return;
	}
}

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 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 676 KB Output is correct
2 Correct 34 ms 3148 KB Output is correct
3 Correct 38 ms 3152 KB Output is correct
4 Correct 31 ms 3204 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 3296 KB Output is correct
2 Correct 37 ms 3216 KB Output is correct
3 Correct 32 ms 3164 KB Output is correct
4 Correct 41 ms 3116 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 3 ms 964 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 3 ms 980 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 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #6
14.0 / 14.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 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
2 Correct 29 ms 3192 KB Output is correct
3 Correct 33 ms 3096 KB Output is correct
4 Correct 29 ms 3164 KB Output is correct
5 Correct 28 ms 3140 KB Output is correct
6 Correct 30 ms 3552 KB Output is correct
7 Correct 28 ms 3148 KB Output is correct
8 Correct 28 ms 3136 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4644 KB Output is correct
2 Correct 283 ms 30628 KB Output is correct
3 Correct 247 ms 32456 KB Output is correct
4 Correct 175 ms 28344 KB Output is correct
5 Correct 127 ms 10104 KB Output is correct
6 Correct 57 ms 3788 KB Output is correct
7 Correct 189 ms 25056 KB Output is correct
8 Correct 151 ms 27316 KB Output is correct