oj.uz

Submission #423906

# Submission time Handle Problem Language Result Execution time Memory
423906 2021-06-11T14:03:34 Z oolimry Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 91852 KB 
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define tern(cond, a, b) (cond ? a : b)
typedef long long lint;
typedef pair<lint,lint> ii;

int n, K;
vector<int> arr;

map<int,int> M;

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	cin >> n >> K;
	n += K;
	arr.resize(n);
	for(int i = 0;i < n;i++) cin >> arr[i];
	
	
	for(int i = K+1;i <= n-K-1;i++){
		int other = n-i;
		for(int j = max(other-K-5,0);j <= min(n-1, other+K+5);j++){
			if(i != j) M[arr[i]+arr[j]]++;
		}
	}
	
	for(int s = 0;s <= K+1;s++){
		for(int e = n-1;e >= n-K-1;e--){
			if(s + (n-1)-e > K) continue;
			
			int str = arr[s]+arr[e];
			
			deque<int> ans;
			for(int i = s;i < K+1;i++){
				auto it = lower_bound(all(arr), str-arr[i]);
				if(it == arr.end()) continue;
				if(*it == str-arr[i] and arr[i] != str-arr[i]) ans.push_back(arr[i]);
			}
			
			for(int i = n-K;i <= e;i++){
				auto it = lower_bound(all(arr), str-arr[i]);
				if(it == arr.end()) continue;
				if(*it == str-arr[i] and arr[i] != str-arr[i]) ans.push_back(arr[i]);
			}
			
			if(sz(ans) + M[str] >= n-K){
				ans.clear();
				
				for(int i = s;i <= e;i++){
					auto it = lower_bound(all(arr), str-arr[i]);
					if(it == arr.end()) continue;
					if(*it == str-arr[i] and arr[i] != str-arr[i]) ans.push_back(arr[i]);
				}
				
				while(sz(ans) > n-K){
					ans.pop_front();
					ans.pop_back();
				}
				for(int x : ans) cout << x << " ";
				return 0;
			}
		}
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 588 KB Output is correct
2 Correct 482 ms 5972 KB Output is correct
3 Correct 487 ms 6084 KB Output is correct
4 Correct 443 ms 6000 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 2964 KB Output is correct
2 Correct 160 ms 4492 KB Output is correct
3 Correct 77 ms 2956 KB Output is correct
4 Correct 165 ms 4548 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 10 ms 460 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 8 ms 484 KB Output is correct
5 Correct 1 ms 204 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 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 3 ms 332 KB Output is correct
3 Correct 24 ms 2360 KB Output is correct
4 Correct 5 ms 588 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

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