oj.uz

Submission #524828

# Submission time Handle Problem Language Result Execution time Memory
524828 2022-02-10T05:56:48 Z maks007 Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 144 ms 6200 KB 
#include <bits/stdc++.h>
 
using namespace std;
 #define break_it assert(false)
#define int long long
main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, k;
	cin >> n >> k;
	vector <int> a(n+k);
	for(int i = 0; i < n +k; i ++) cin >> a[i];
	function <void(int,int, int)> check2=[&](int sum, int start, int end) {
		vector <int> ans;
		ans.push_back(a[start-1]);
		ans.push_back(a[end+1]);
		int l = start, r = end;
		int cnt = 0;
		while(l < r) {
			if(cnt >= k) return;
			if(a[l] + a[r] == sum) {
				
				ans.push_back(a[l]);
				ans.push_back(a[r]);
				l ++;
				r --;
			}else if(a[l] + a[r] > sum) {
				r--;
				cnt ++;
			}else l ++, cnt ++;
			if(ans.size() >= n) break;
		}
		if(ans.size() == n) {
			sort(ans.begin(), ans.end());
			for(auto i : ans) cout << i << " ";
			exit(0);
		}
	};
	function <void(int, int, int)> solve=[&](int start, int end, int sm = 0) {
		vector <int> fors;
		int sum = 0;
		if(start == end and end == -1) sum = sm;
		else sum = a[start] + a[end];
		int none = -1;
		int l = 0, r = n+k-1;
		while(l < r){
			if(a[l] + a[r] > sum) {
				if(none != -1) return;
				none = r;
				r--;
			}else if(a[l] + a[r] < sum) {
				if(none != -1) return;
				none = l;
				l ++;
			}
			l ++;
			r --;
		}
		if(none == -1) {
			none = (n+k)/2;
		}
		for(int i = 0; i <= n+k-1; i ++) {
			if(none == i) continue;
			fors.push_back(a[i]);
		}
		for(auto i : fors) cout << i << " ";
		exit(0);
	};	
	if(k == 1) {
		solve(0, n+k-1, 0);
		solve(0, n+k-2, 0);
		solve(1, n+k-1, 0);
		return 0;
	}
	map <int,int> mp;
	vector <int> candidate;
	for(int i = 0; i <= k; i ++) {
		for(int j = i+n-1; j < n+k; j ++) {
			check2(a[i] + a[j], i+1, j-1);
		}
	}
		
	
		
	return false;
}

Compilation message

tabletennis.cpp:6:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    6 | main(void) {
      | ^~~~
tabletennis.cpp: In lambda function:
tabletennis.cpp:31:18: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   31 |    if(ans.size() >= n) break;
      |       ~~~~~~~~~~~^~~~
tabletennis.cpp:33:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   33 |   if(ans.size() == n) {
      |      ~~~~~~~~~~~^~~~

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 976 KB Output is correct
2 Correct 25 ms 4292 KB Output is correct
3 Correct 25 ms 4172 KB Output is correct
4 Correct 25 ms 4168 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 4176 KB Output is correct
2 Correct 30 ms 4212 KB Output is correct
3 Correct 30 ms 4292 KB Output is correct
4 Correct 30 ms 4176 KB Output is correct

Subtask #4
15.0 / 15.0

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

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 0 ms 204 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 1 ms 204 KB Output is correct
2 Correct 30 ms 4236 KB Output is correct
3 Correct 31 ms 4172 KB Output is correct
4 Correct 29 ms 4268 KB Output is correct
5 Correct 29 ms 4172 KB Output is correct
6 Correct 36 ms 4204 KB Output is correct
7 Correct 30 ms 4216 KB Output is correct
8 Correct 30 ms 4180 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 144 ms 4264 KB Output is correct
3 Correct 29 ms 4156 KB Output is correct
4 Correct 83 ms 4164 KB Output is correct
5 Correct 65 ms 4388 KB Output is correct
6 Correct 32 ms 6200 KB Output is correct
7 Correct 114 ms 4172 KB Output is correct
8 Correct 29 ms 4176 KB Output is correct