oj.uz

Submission #499893

# Submission time Handle Problem Language Result Execution time Memory
499893 2021-12-29T22:37:46 Z jesus_coconut Table Tennis (info1cup20_tabletennis) C++17
29 / 100
 3000 ms 79712 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;
}

vector<int> ans;

bool solve(int suma) {
	ans.clear();
	int l = 0, r = n + k - 1;
	int cnt = 0;
	while (l < r) {
		if (v[l] + v[r] == suma) {
			ans.pb(v[l]);
			ans.pb(v[r]);
			if (size(ans) == 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;
}

set<int> bio;

void solve() {
	while (true) {
		int i = rand() % (n + k);
		int j = n - 1 - i + (rand() % (2 * k + 1));
		if (j < 0 || 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(all(ans));
			for (auto &it: ans) cout << it << ' ';
			return;
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	load();
	sort(all(v));
	solve();

	return 0;
}

Compilation message

tabletennis.cpp: In function 'bool solve(int)':
tabletennis.cpp:24:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |    if (size(ans) == n) return true;
      |        ~~~~~~~~~~^~~~

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 716 KB Output is correct
2 Correct 33 ms 3008 KB Output is correct
3 Correct 31 ms 3084 KB Output is correct
4 Correct 32 ms 3008 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 3040 KB Output is correct
2 Correct 36 ms 3136 KB Output is correct
3 Execution timed out 3032 ms 1100 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Execution timed out 3063 ms 844 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

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

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Execution timed out 3066 ms 352 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Execution timed out 3063 ms 10072 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 3060 ms 79712 KB Time limit exceeded
3 Halted 0 ms 0 KB -