oj.uz

Submission #692278

# Submission time Handle Problem Language Result Execution time Memory
692278 2023-02-01T09:36:49 Z NeroZein Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 13696 KB 
/*
 *    author: NeroZein
 *    created: 01.02.2023 12:23:57
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,fast-math,unroll-loops")
#pragma GCC target("avx2,fma")
#define int long long
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k;
	cin >> n >> k;
	vector<int> a(n + k);
	map<int, bool> mp; 
	for (int i = 0; i < n + k; ++i) {
		cin >> a[i]; 
		mp[a[i]] = 1; 
	}
	sort(a.begin(), a.end()); 
	for (int i = 0; i <= k; ++i) {
		for (int j = n + k - 1; j > i; --j) {
			int cnt = i + (n + k - j - 1); 
			if (cnt > k) {
				break; 
			}
			int tar = a[i] + a[j];
			for (int x = i + 1; x < j; ++x) {
				if (!mp.count(tar - a[x])) {
					cnt++;
				}
			}
			if (cnt == k) {
				//deb(
				vector<int> ans; 
				for (int x = i; x <= j; ++x) {
					if (mp.count(tar - a[x])) {
						ans.push_back(a[x]);
					}
				}
				for (int x : ans) {
					cout << x << ' ';
				}
				return 0; 
			}
		}
	}
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2140 KB Output is correct
2 Correct 125 ms 13640 KB Output is correct
3 Correct 110 ms 13632 KB Output is correct
4 Correct 108 ms 13684 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 13632 KB Output is correct
2 Correct 125 ms 13696 KB Output is correct
3 Correct 184 ms 13632 KB Output is correct
4 Correct 121 ms 13608 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 13 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 9 ms 212 KB Output is correct
5 Correct 1 ms 212 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 0 ms 212 KB Output is correct
2 Correct 19 ms 452 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 14 ms 468 KB Output is correct
5 Correct 3 ms 400 KB Output is correct
6 Correct 4 ms 468 KB Output is correct

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

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