oj.uz

Submission #500280

# Submission time Handle Problem Language Result Execution time Memory
500280 2021-12-30T15:18:04 Z jesus_coconut Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 42 ms 4500 KB 
#include <bits/stdc++.h>
#define pb push_back
#define all(a) begin(a), end(a)
using namespace std;

int n, k;
vector<int> v;
void load() {
	cin >> n >> k;
	v.resize(n + k);
	for (auto &it : v) cin >> it;
}

int const N = 150005;

int ans[N];

bool solve(int suma) {
	int l = 0, r = n + k - 1;
	int cnt = 0;
	int p = 0;
	while (l < r) {
		if (v[l] + v[r] == suma) {
			ans[p++] = v[l];
			ans[p++] = v[r];
			if (p == n) return true;
			++l;
			--r;
		} else if (v[l] + v[r] < suma) {
			++l;
			if (++cnt > k) return false;
		} else {
			--r;
			if (++cnt > k) return false;
		}
	}
	return false;
}

unordered_set<int> bio;

void solve() {
	while (true) {
		int i = rand() % (n + k);
		int j = n + k - 1 - i + k - (rand() % (2 * k + 1));
		if (i >= j || j >= n + k || bio.count(v[i] + v[j])) continue;
		bio.insert(v[i] + v[j]);
		if (solve(v[i] + v[j])) {
			sort(ans, ans + n);
			for (int i = 0; i < n; ++i) {
				cout << ans[i] << ' ';
			}
			return;
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	srand(chrono::steady_clock::now().time_since_epoch().count());
	load();
	sort(all(v));
	solve();

	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 38 ms 4372 KB Output is correct
3 Correct 35 ms 4356 KB Output is correct
4 Correct 33 ms 4296 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 4344 KB Output is correct
2 Correct 36 ms 4376 KB Output is correct
3 Correct 34 ms 4500 KB Output is correct
4 Correct 33 ms 4292 KB Output is correct

Subtask #4
15.0 / 15.0

# 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 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 35 ms 4360 KB Output is correct
3 Correct 35 ms 4364 KB Output is correct
4 Correct 32 ms 4392 KB Output is correct
5 Correct 42 ms 4344 KB Output is correct
6 Correct 38 ms 4420 KB Output is correct
7 Correct 38 ms 4340 KB Output is correct
8 Correct 32 ms 4356 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 1036 KB Output is correct
2 Correct 32 ms 4356 KB Output is correct
3 Correct 34 ms 4360 KB Output is correct
4 Correct 35 ms 4352 KB Output is correct
5 Correct 38 ms 4420 KB Output is correct
6 Correct 33 ms 4420 KB Output is correct
7 Correct 36 ms 4420 KB Output is correct
8 Correct 33 ms 4352 KB Output is correct