oj.uz

Submission #674459

# Submission time Handle Problem Language Result Execution time Memory
674459 2022-12-24T10:20:00 Z QwertyPi Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 2941 ms 15152 KB 
#include <bits/stdc++.h>

using namespace std;

int n, k; 
int a[150401];

void gen(int x){
	vector<int> Fr, Ba;
	int l = 0, r = n + k - 1;
	while(l < r){
		if(a[l] + a[r] == x) { Fr.push_back(l); Ba.push_back(r); l++; r--; }
		else if(a[l] + a[r] > x) r--;
		else l++;
	}
	reverse(Ba.begin(), Ba.end());
	for(auto i : Fr) cout << a[i] << ' ';
	for(auto i : Ba) cout << a[i] << ' ';
}

unordered_map<int, int> M;

int main(){
	cin.tie(0); cout.tie(0)->sync_with_stdio(false);
	cin >> n >> k;
	for(int i = 0; i < n + k; i++){
		cin >> a[i];
	}
	vector<int> v;
	for(int i = 0; i <= k; i++){
		for(int j = max(i + 1, n + k - 1 - i - k); j <= min(n + k - 1, n + k - 1 - i + k); j++){
			M[a[i] + a[j]]++;
		}
	}
	for(int i = k + 1; i < n + k; i++){
		for(int j = max(i + 1, n + k - 1 - i - k); j <= min(n + k - 1, n + k - 1 - i + k); j++){
			if(M.count(a[i] + a[j])) M[a[i] + a[j]]++;
		}
	}
	for(auto m : M){
		if(m.second == n / 2){
			gen(m.first);
			return 0;
		}
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 30 ms 3152 KB Output is correct
3 Correct 30 ms 3064 KB Output is correct
4 Correct 30 ms 3200 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3156 KB Output is correct
2 Correct 33 ms 3144 KB Output is correct
3 Correct 33 ms 3136 KB Output is correct
4 Correct 31 ms 3200 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 724 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 82 ms 3228 KB Output is correct
3 Correct 70 ms 3200 KB Output is correct
4 Correct 76 ms 3200 KB Output is correct
5 Correct 73 ms 3080 KB Output is correct
6 Correct 122 ms 3136 KB Output is correct
7 Correct 75 ms 3196 KB Output is correct
8 Correct 73 ms 3136 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 4916 KB Output is correct
2 Correct 2901 ms 13480 KB Output is correct
3 Correct 2941 ms 15152 KB Output is correct
4 Correct 2134 ms 13992 KB Output is correct
5 Correct 1031 ms 7912 KB Output is correct
6 Correct 1634 ms 4788 KB Output is correct
7 Correct 2143 ms 11516 KB Output is correct
8 Correct 2069 ms 14228 KB Output is correct