oj.uz

Submission #775677

# Submission time Handle Problem Language Result Execution time Memory
775677 2023-07-06T18:32:40 Z LeaRouse Table Tennis (info1cup20_tabletennis) C++14
20 / 100
 3000 ms 328648 KB 
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define ff first
#define ss second
#define ll long long
using namespace std;
const int MAX=2e5+5;
const ll INF=1e10;
int A[MAX];
int n,k;;
unordered_map<int,int>m;
vector<int>v;
bool res(int suma){
	int ans=0;
	for(int i=0;i<n+k;i++){
		if(!m[A[i]] || ans==n/2)	continue;
		if(A[i]>suma/2)	continue;
		if(m[suma-A[i]]){
			ans++;
			v.push_back(A[i]);
			v.push_back(suma-A[i]);
		}	
	}
	if(ans==n/2)	return true;
	else 	return false;
}

void go(){
		cin>>n>>k;
	for(int i=0;i<(n+k);i++){
		cin>>A[i];
		m[A[i]]++;
	}
	sort(A,A+n+k);
	for(int i=0;i<=k;i++){
		for(int j=0;j<=k;j++){
			int suma=A[i]+A[n+k-1-j];
			if(res(suma)){
				sort(v.begin(),v.end());
				for(auto it:v)	cout<<it<<" ";
				cout << endl;
				break;
			}
			else	v.clear();
		}
	}

}
 
int main(){
	fastio;
	go();
	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 472 KB Output is correct
3 Correct 2 ms 596 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 2000 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 287 ms 32128 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 20512 KB Output is correct
2 Incorrect 105 ms 22076 KB Extra information in the output file
3 Halted 0 ms 0 KB -

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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Incorrect 24 ms 9796 KB Extra information in the output file
3 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3072 ms 328648 KB Time limit exceeded
2 Halted 0 ms 0 KB -