oj.uz

Submission #926998

# Submission time Handle Problem Language Result Execution time Memory
926998 2024-02-14T06:27:41 Z blacktulip Table Tennis (info1cup20_tabletennis) C++17
20 / 100
 3000 ms 4444 KB 
#include <bits/stdc++.h>

using namespace std;

#define ort ((bas+son)/2)
#define int long long
#define endl "\n"

int n,k,a[150005],ind;

inline bool check(int l,int r,int sum){
	int say=0;
	while(l<r){
		if(a[l]+a[r]==sum){
			l++;
			r--;
			say++;
		}
		else if(a[l]+a[r]<sum){
			ind=l;
			l++;
		}
		else{
			ind=r;
			r--;
		}
	}
	if(l==r)ind=l;
	if(say>=n/2)return 1;
	return 0;
}

int32_t main(void){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	cin>>n>>k;
	for(int i=1;i<=n+k;i++)cin>>a[i];
	if(check(1,n+k,a[1]+a[n+k])){
		for(int i=1;i<ind;i++)cout<<a[i]<<" ";
		for(int i=ind+1;i<=n+k;i++)cout<<a[i]<<" ";
		//~ cout<<"**\n";
		//~ cout<<ind<<endl;
		return 0;
	}
	if(check(1,n+k-1,a[1]+a[n+k-1])){
		for(int i=1;i<n+k;i++)cout<<a[i]<<" ";
		return 0;
	}
	if(check(2,n+k,a[2]+a[n+k])){
		for(int i=2;i<=n+k;i++)cout<<a[i]<<" ";
		return 0;
	}
	while(1){}
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 22 ms 2912 KB Output is correct
3 Correct 21 ms 4444 KB Output is correct
4 Correct 21 ms 4320 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 14.0

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

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

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